HCU PHD CS JUNE 2021
January 20, 2025HCU PHD CS DEC 2020
January 21, 2025GATE 2011
| Question 40 |
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?
| 0 | |
| 1 | |
| n! | |
 |
Question 40 Explanation:
The number of ways to populate the given unlabeled binary tree with n distinct elements such that it becomes a binary search tree (BST) is given by the nth Catalan number.
Correct Answer: D
Question 40 Explanation:
The number of ways to populate the given unlabeled binary tree with n distinct elements such that it becomes a binary search tree (BST) is given by the nth Catalan number.
Subscribe
Login
0 Comments