You wish to traverse a binary search tree in sorted order using preorder 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 preorder traversal, the root node is processed first, followed by the left subtree, and then the right subtree.

You Wish to Traverse a Binary Search Tree in Sorted