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

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

Create a order 3 B-Tree for the following key data    10, 6, 12, 18, 13, 15, 3, 2, 1. What are the key values at the leaf nodes from left to write in the sequence.*1 point1,2,6,12,15,182,6,10,13,15,182,10,12,15,1818,15,3,2,2

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

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

Question 10Which of the following sequences cannot occur from a postorder traversal of a binary search tree with the keys 1, 2, 3, 4, 5?