Question 1. [20 marks]Figure 1 Binary Tree(a) Given the binary tree in Figure 1, list the pre-order tree walk result.(b) Given the binary tree in Figure 1, list the in-order tree walk result

Question 2. [25 marks]Draw a binary tree for the set of key values {a,b,c,d,e,f,g,h,i,j,k}, and the binary treeshould exactly have the following in-order AND post-order tree walk sequences:- In-order tree walk sequence: d,e,c,b,a,g,k,h,f,j,i- Post-order tree walk sequence: e,d,b,c,k,h,g,j,i,f,a

The inorder and preorder traversal of a binary tree are Inorder: d b e a p q r PreOrder: a b d e q p r The postorder traversal of the binary tree is: (A) d e b p r q a (B) e d b r p q a (C) e d b p r q a (D) d e p r b q a

Question 2 (20 Marks)Here is a small binary tree of integers that is needed for the next questions14/ \3 19/ \ / \2 6 16 30\ / \13 23 42a) Determine the depth of the tree? (4 Marks)b) True or False:i. Determine whether the tree is full or not. (3 Marks)ii. Determine whether the tree is complete or not. (3 Marks)

- Provide a detailed algorithm for the Inorder tree traversal method. explain the answer for 5 marks

Given the following binary tree, perform an in-order traversal and list the nodes in the order they are visited.  *1 pointD, B, E, A, C, FD, B, E, A, F, CD, B, A, E, C, FA, B, C, D, E, F