Question

infix expression to binary tree

Answer 1

In general, to parse and evaluate an (infix) expression, you need to: ... convert from infix to binary expression tree: this is usually done with algorithms such as Shunting yard algorithm. create a grammar that defines operation precedence and allows strict1 order of expressionevaluation.