GATE Computer Science (CS) 2011 Solved Paper

Question : 39 of 65

Marks: +1, -0

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?