You wish to traverse a binary search tree in sorted order.Arrange the following actions in the correct order to accomplish this.
i.Print the right subtree recursively
II.Print the root
III.Print the left subtree recursively
A)I, II, III
B)II, III, I
C)III, I, II
D)III, II, I

Question

Quizplus · Accepted Answer

To traverse a binary search tree in sorted order, you should first print the left subtree recursively (to handle all smaller elements), then print the root (the current element), and finally print the right subtree recursively (to handle all larger elements). This is known as an in-order traversal.

You Wish to Traverse a Binary Search Tree in Sorted