How many different binary search trees can be constructed with 6 different nodes?
Show answerHide answer
Correct answer: (D) 132
Explanation
The number of distinct BSTs on n keys is the Catalan number C(n) = (2n)!/((n+1)! n!). For n = 6 this is 132.
From DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021
This is question 75 of DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.