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

Article Tags :

Data Structures

DSA

Binary Search Trees

Data Structures

Data Structures-Binary Search Trees

Recommended Articles

1. Data Structures | Binary Search Trees | Question 1

2. Data Structures | Binary Search Trees | Question 2

3. Data Structures | Balanced Binary Search Trees | Question 2

4. Data Structures | Binary Search Trees | Question 5

5. Data Structures | Balanced Binary Search Trees | Question 2

6. Data Structures | Binary Search Trees | Question 6

7. Data Structures | Binary Search Trees | Question 7

8. Data Structures | Balanced Binary Search Trees | Question 4

9. Data Structures | Balanced Binary Search Trees | Question 5

10. Data Structures | Balanced Binary Search Trees | Question 13

11. Data Structures | Balanced Binary Search Trees | Question 7

12. Data Structures | Balanced Binary Search Trees | Question 13

13. Data Structures | Balanced Binary Search Trees | Question 9

14. Data Structures | Balanced Binary Search Trees | Question 13

15. Data Structures | Balanced Binary Search Trees | Question 11

16. Data Structures | Binary Search Trees | Question 10

17. Data Structures | Binary Search Trees | Question 12

18. Data Structures | Binary Search Trees | Question 12

19. Data Structures | Balanced Binary Search Trees | Question 12

20. Data Structures | Balanced Binary Search Trees | Question 13

21. Data Structures | Binary Search Trees | Question 3

22. Data Structures | Binary Search Trees | Question 8

23. Data Structures | Binary Search Trees | Question 12

24. Data Structures | Balanced Binary Search Trees | Question 10

25. Total number of possible Binary Search Trees and Binary Trees with n keys