You wish to traverse a binary search tree in sorted order using inorder traversal. 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) III, II, I
C) II, III, I
D) III, I, II

Question

Quizplus · Accepted Answer

In inorder traversal of a binary search tree, you first recursively visit the left subtree, then print the root, and finally recursively visit the right subtree.

You Wish to Traverse a Binary Search Tree in Sorted