GATE | GATE-CS-2015 (Set 1) | Question 20

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?

1. 3, 5, 7, 8, 15, 19, 25
2. 5, 8, 9, 12, 10, 15, 25
3. 2, 7, 10, 8, 14, 16, 20
4. 4, 6, 7, 9, 18, 20, 25 

(A) 1 and 4 only
(B) 2 and 3 only
(C) 2 and 4 only
(D) 2 only


Answer: (A)

Explanation: An Inorder traversal of a Binary Search Tree must be in increasing order.

Quiz of this Question

My Personal Notes arrow_drop_up