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

Question

Quizplus · Accepted Answer

Postorder traversal involves visiting the left subtree recursively, then the right subtree recursively, and finally the root. Therefore, the correct order is to first print the left subtree recursively, then print the right subtree recursively, and finally print the root. So the correct order is III, I, II, which is given in option C.

You Wish to Traverse a Binary Search Tree Using Postorder