Data Structures | Binary Search Trees | Question 3

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? (GATE CS 2011)
(A) 0
(B) 1
(C) n!
(D) (1/(n+1)).2nCn

Answer: (B)

Explanation: There is only one way. The minimum value has to go to the leftmost node and the maximum value to the rightmost node. Recursively, we can define for other nodes.

My Personal Notes arrow_drop_up