Part II: Problem Solving: Question 1 (10 points). With respect to the programming problem in Part I, What is the tightest asymptotic running time for each of your operations, expressed in terms of the number of digits for the two operands, m and n, of each operation? Clearly justify your answer. Question 2. (20 points) Consider the following General Tree: a. (5 points) Show the breadth first traversal of the above tree. b. (5 points) Show the preorder traversal of the above tree. c. (5 points) Show the post-order traversal of the above tree. d. (5 points) Show the in-order traversal of the subtree rooted at node 30 ..
Part II: Problem Solving: Question 1 (10 points). With respect to the programming problem in Part I, What is the tightest asymptotic running time for each of your operations, expressed in terms of the number of digits for the two operands, m and n, of each operation? Clearly justify your answer. Question 2. (20 points) Consider the following General Tree: a. (5 points) Show the breadth first traversal of the above tree. b. (5 points) Show the preorder traversal of the above tree. c. (5 points) Show the post-order traversal of the above tree. d. (5 points) Show the in-order traversal of the subtree rooted at node 30 ..