Teaching Rajasthan Basic Computer Instructor 2021 Mock Test Programming and Data Structure Binary Heap Binary Search Tree
Which of the following is/are correct in-order 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
1
I and IV only
2
II and III only
3
II and IV only
4
II only