Problem
1. Draw expression trees for each of the following expressions, and show the order of visiting the vertices in (1) preorder, (2) inorder, and (3) postorder:
a. log n!
b. (a-b)-c
c. a-(b-c)
d. (a
2. Write a method and the corresponding recursive function to count all the nodes Binary_tree size of a linked binary tree.