- #1
barbara
- 10
- 0
+
/ \
/ \
* -
/ \ / \
2 3 * +
/ \ / \
4 2 1 5
What type of algorithm is this I think the computation can be expressed as (2*3)+((4*2)-(1+5)). is this correct. I know its a postorder tree I just don't know if a left or right subtree exists Print root end. Does it anything to do with recursion or repetition
/ \
/ \
* -
/ \ / \
2 3 * +
/ \ / \
4 2 1 5
What type of algorithm is this I think the computation can be expressed as (2*3)+((4*2)-(1+5)). is this correct. I know its a postorder tree I just don't know if a left or right subtree exists Print root end. Does it anything to do with recursion or repetition
Last edited: