4. Given the following traversal on the binary tree Inorder traversal gives: 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 19, 20 Preorder traversal gives: 7, 4, 2, 3, 6, 5, 12, 9, 8, 11, 19, 15, 20. 5. Construct a binary tree from a given preorder and inorder sequence: Inorder: nl n2 n3 n4 n5 n6 n7 n8 n9 Preorder: n6 n2 nl n4 n3 n5 n9 n7 n8 6. For the binary search tree shown in figure Suppose we remove the root, [] replacing it with something from the left subtree. What will be the new root 4 7. A binary search tree is constructed by inserting the following numbers in order: 20,11,33,5,6,7,30,38 The number of nodes is the right subtree is 7. Post order traversal of a given binary search tree T produces following sequence of keys: 33, 53, 73, 91, 41, 18, 15, 20, 18, 15, 14. List the inorder traversal 8. Consider the tree given below. If the inorder traversal gives BCEAD, the labels of 1,2,3,4,5 respectively are: 2 1 5 5 stack.push(,,A"); stack.push(,,B"); stack.pop(); 16 3 Edge Node 9. Trace the following code and