How many Binary Search Trees are possible for a labelled nodes?

Question

Let us there are n nodes which are labelled.

Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$

Then the binary search trees possible is just $1$?

Comments

For a given unlabeled tree, there is only 1 way a BST can be formed.

For n labeled nodes, Catalan Number of BST can be formed.

---

Hi the language of the question is pretty vague, please copy and paste the exact question.

Answer 1

There can be multiple BST. eg left skew BST or right skew BST and so on…. Depends on the labelled nodes.