if current character of ternary expression is ' ? ' then we add next character as a left child of current node
if ( i < expression . Length && expression [ i ] == ' ? ' ) { root . left = convertExpression ( expression , i + 1 ) ; }