< Previous Next > 1597. Build Binary Expression Tree From Infix Expression (Hard) Related Topics [String] [Stack] [Tree] [Binary Tree] Similar Questions Basic Calculator III (Hard) Check If Two Expression Trees are Equivalent (Medium) Hints Hint 1 Convert infix expression to postfix expression. Hint 2 Build an expression tree from the postfix expression.