23
– Applications 2
In exercises 6-10, represent the postfix/postorder expression as a binary tree and write the usual infix/inorder form of the expression.
1. A C +
2. B D -
3. D C /
4. B A *
5. A B + C –
6. A B C + -
7 A B C D + * /
8 A B / C D * +
9. D C – A B + *
10. B A D – C + *
In exercises 11-15, determine the value of the postfix/postorder expression knowing that A=1, B=2, C=3, and D=4
11. C A -
12. A B + C –
13. C B A + -
14. D 2 A * + B -
15. A B * B D / +