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: See question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-23/ for explanation. The link also has a generalized solution.



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions