ace mock test

Question

How many binary search trees  can be formed with n distinct and designated(labeled) nodes...??

Answer 1

For n Nodes ; For making Binary Search Tree. We should follow a property of BST i.e. its InOrder Traversal should be always in Sorted Order.

If we are having n keys ( being distinct ) then we can have only one Sorted Order.

To achieve this Sorted Order we can arranged node in (2n C n/ (n+1) ) ways to get the Binary Trees with Labelled Nodes.

So, we have ( 2n C n / ( n+1 ) ) BST .