Distinct Binary Search Tree


#1

How many distinct binary search tree can be created out of 4 distinct keys?

  1. 5
  2. 14
  3. 24
  4. 42

Justify
Thanks


#2

Answer is 14, As Number of Binary Search trees for n nodes is given by = (2n)! / n! * (n+1)! Hence 14 distinct binary search trees possible for 4 keys .