Hi, today I'm going to do something with expression trees. An expression tree, is a binary search tree, with which one can represent arithmetic expressions. Here each node is either an operator or a number.
An expression tree is often used to change infix operations, i.e. the way we compute in Postfix. Some computers work with Postfix, e.g. the HP 15C. With expression trees, the parentheses are omitted.
Suppose we want to represent this calculation: , as a tree. The tree then looks like this.
A tree, you can traverse with Inorder, Preorder and with Postorder.
Inorder: = Infix
Preorder: = Prefix
Postorder: = Postfix
There is really nothing more to say. I hope you were able to understand Expressiontrees 😄.