You Wish to Traverse a Binary Search Tree Using Preorder

Multiple Choice

You wish to traverse a binary search tree 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) II, III, I
B) II, I, III
C) I, II, III
D) III, I, II