There are 2nCn/(n+1) unlabelled trees possible , now each of these unlabelled trees corresponds to one binary search tree since u have to populate an unlabelled tree with the 4 keys in such a fashion that they satisfy the property of a BST and hence no of BST's=catalan's no