-
Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s) ?
I. 3, 5, 7, 8, 15, 19, 25 II. 5, 8, 9, 12, 10, 15, 25
III. 2, 7, 10, 8, 14, 16, 20 IV. 4, 6, 7, 9, 18, 20, 25
-
- I and IV only
- II and iii only
- II and IV only
- II only
- I and IV only
Correct Option: A
In-order traversal of binary search tree gives ascending orders and in BST, at every node root element is greater than and equal to all element present in left sub-tree and less than or equal to all the elements in right subtree.
