GATE | GATE CS 2011 | Question 29

We are given a set of n distinct elements and an unlabelled 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?
(A) 0
(B) 1
(C) n!
(D) (1/(n+1)).2nCn

Answer: (B)
Explanation: See https://www.geeksforgeeks.org/data-structures-and-algorithms-set-26/amp/
Quiz of this Question