

MCQOPTIONS
Saved Bookmarks
1. |
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. | (1/(n+1)).2nCn |
Answer» C. n! | |