Which of the following traversal outputs the data in sorted order in a BST? a) Preorder b) Inorder c) Postorder d) Level order 4) 5) The following numbers are inserted into an empty binary search tree in the given order: 10, 1,3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? a) 2 Consider the following binary search tree T given below: Which node contains the fourth smallest element in T? a) Q b)V c) W d)X What is common in three different types of traversals (Inorder, Preorder and Postorder)? a) 7) b) c) d) Root is visited before right subtree Root is visited after left subtree Left subtree is always visited before right subtree All of the above Date: 11th