New answers tagged binary-tree
You need an expression evaluator, as an abstract syntax tree interpreter. What an interpreter does is: start with some known state, e.g. variables, (blank) outputs, etc.. Then it execute statements to update that state. To execute expression statements, you might use a recursive expression evaluator, which would do something like this: for a constant ...
Top 50 recent answers are included