Parsing mathematical expressions into a binary tree — Part 2
1 min readOct 9, 2014
The second part of the problem involved adding parentheses functionality, which turned out easier than expected.
The entire code is below:
To test this code run something like:
evaluate(infixToBinaryTree(“3+4*2/(1-(3+4*2/1–5))”))This should return 1.4
