How many distinct binary search trees can be created out of 4 distinct keys?
(A)
4
(B)
14
(C)
24
(D)
42
Answer: (B)
Explanation:
number of distinct BSTs = (2n)!/[(n+1)!*n!] .
Quiz of this Question
Please comment below if you find anything wrong in the above post
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!