Question

Assume that the following values are inserted into binary search tree in the given order : 40, 50, 70, 20, 30, 10, 60, 90, 80, 100. Consider the following function:

Find the output printed by the above function, if the root of the binary search tree is passed to the "tree" function.

Void find (Node*root)
{
if (root == NULL) return;
find (root $\to$ left)
find (root $\to$ right);
printf("%d" , root $\to$ data);
}
struct node
{
int data;
struct node * left;
struct node * right;
} Node;

• A. 30, 20, 100, 80, 90, 60, 70, 50, 10, 40
• B. 10, 20, 30, 40, 50, 60, 70, 80, 90, 100
• C. 10, 30, 20, 60, 80, 100, 90, 70, 50, 40
• D. 30, 20, 10, 60, 80, 100, 90, 70, 50, 40

Answer 1

The correct option is C 10, 30, 20, 60, 80, 100, 90, 70, 50, 40

Binary search tree of given sequence is



The given function perform post order traversal on the binary search tree.
So output is 10, 30, 20, 60, 80, 100, 90, 70, 50, 40.