how to convert an infix expression to binary tree
Answers
Answered by
1
A very similar process is used to construct a binary expression tree. Each time we see an operator, do the same actions as we do for the operator precedence parsing algorithm. ... At the end, the node object on the top of the operand stack is the root of the expression tree for the given infix expression.
Similar questions