Exercise 1.
Implement a binary tree data structure to store arithmetic expressions.
See Lec05-Trees for graphic description of the data structure.
The data stored at each tree node is an int value. If a node is internal, the value should be in the range 1..4, representing one of four operators + - * /. If a node is external, the value is the operand's value.
Exercise 2.
Implement a small program that creates a tree using Exercise 1's results.
Exercise 3.
Implement inorder traversal and postorder traversal to print the tree. Test your implementation by modifying the program written in Exercise 2.