Memory-Interfacing
October 8, 2023Data-Structures
October 8, 2023Binary-search-tree
| Question 7 |
Let T(n) be the number of different binary search trees on n distinct elements. Then 
, where x is
| n – k + 1 | |
| n – k | |
| n – k – 1 | |
| n – k – 2 |
Question 7 Explanation:
A binary search tree consists of n distinct elements. Let consider on left subtree, it consists of (k-1) elements. Then right subtree consists of (n-k) elements. From this we c an write recursive function as T(k-1)*(n-k) i.e.,
Correct Answer: B
Question 7 Explanation:
A binary search tree consists of n distinct elements. Let consider on left subtree, it consists of (k-1) elements. Then right subtree consists of (n-k) elements. From this we c an write recursive function as T(k-1)*(n-k) i.e.,
Subscribe
Login
0 Comments