Background Banter:

As per salem's advice earlier today ive learnt how to convert from infix to postfix using a stack, and how to then evaluate that RPN expression.

My next question is how to do this using a tree, ive done quite a bit of reading and have figured out how to evaluate an expression already parsed into the tree, but I cant find a resource, book or otherwise documenting how to parse an infix expression into a tree structure. Generally speaking im a little tired and may have missed something but im normally thorough with searching.

Question:

1 - With an algebraic, possibly containing complex arithmeitic, infix expression passed as an input, how do you parse this input expression into a tree structure, operators as nodes, variables as child, in order to then evaluate using a recursion algorithm.

Thanks in advance, any advice is greatly appreciated.

This topic is technically different to the last one I started, although they are linked by commonality of purpose. My thinking was that this is how the admin's would prefer, if I'm wrong please accept my apologies, delete this and I will append to my earlier post.