Question

Total number of binary trees possible with n nodes

Answer 1

Total number of possible Binary Search Trees with n keys. Total number of possible Binary Search Trees with n different keys = Catalan number Cn = (2n)!/(n+1)!*n! For n = 0, 1, 2, 3, … values of Catalan numbers are 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, ….