We are given a set of \(n\) distinct elements and an unlabeled binary tree…
PYQ GATE 2011
We are given a set of distinct elements and an unlabeled binary tree with nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?
- A.
- B.
- C.
- D.
Attempted by 1098 students.
Sign up free to check your answer
Sign up freeLoading lesson…

