Formula to find the number of binary serach trees form from given nodes

Summing over i gives the total number of binary search trees with n nodes.

The base case is t(0) = 1 and t(1) = 1, i.e. there is one empty BST and there is one BST with one node.

Comments

Popular posts from this blog

Addition of two numbers in android

Edit Java Class file at runtime

NoSQL