We are given a set of \(n\) distinct elements and an unlabeled binary tree…

GATE · 2011 · CS · Computer Science & IT

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?

A.
\(0\)
B.
\(1\)
C.
\(n!\)
D.
\(\frac{1}{n+1}\binom{2n}{n}\)

Attempted by 887 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2