I have been working on an assignment on building a binary expression tree from a prefix expression. I know how to do it but I am really having trouble coming up with an algorithm to insert the elements of the expression into the tree. Can anyone help in anyway? All I need is some psuedo-code and I can write the actual code but I have spent so much time trying to figure it out and it is driving me crazy. Any help would be greatly appreciated.
Binary expression trees (C++)?
- Thread starter Meg
- Start date