in DS
134 views
0 votes
0 votes
The number of binary search tree’s with 4 nodes (1, 2, 3, 4) possible where in every binary search tree ‘1’ is leaf node are .....

How to solve such type of questions in the simple way?
in DS
by
134 views

2 Comments

5 ?
0
0

$n^{th}$ Catalan Number, where n = 3

Answer is 5

1
1

Please log in or register to answer this question.