Skip to content
Related Articles

Related Articles

Data Structures | Binary Search Trees | Question 4

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 08 Feb, 2013

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 for explanation. The link also has a generalized solution.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!