Gate CS-2005 Question Paper With Solutions

Q. 35 How many distinct binary search trees can be created out of 4 distinct keys?

(A) 5

(B) 14

(C) 24

(D) 42

Answer: (B)

Explanation: