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

PYQ GATE 2011

We are given a set of nn distinct elements and an unlabeled binary tree with nn nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?

  1. A.

    00

  2. B.

    11

  3. C.

    n!n!

  4. D.

    1n+1(2nn)\frac{1}{n+1}\binom{2n}{n}

Attempted by 1098 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…