I have to write a program to put an infix expression into a binary
expression tree. I cannot convert it to prefix or postfix first. Ive
converted infix to postfix before.
Im having trouble when it comes to an expression like the following:
(A+B*(C-D))/E
where C-D will be at the bottom of the tree.
Im not looking for code. Im looking for help in designing an algorithm.
Should I use a stack to store nodes to climb back up the tree?
Im having trouble getting started with my algorithm.