Data Structures | Binary Search Trees | Question 4

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

My Personal Notes arrow_drop_up

Save