Permutations on BST

Ramesh has a permutation P of the integers {1, 2, 3, ... , N} He also has an empty Binary Search Tree. First of all, he would like to tell you what a Binary Search Tree (BST) is. A binary tree is a tree where each node has at most two children. In a BST, there is the additional property, that for each node, its left sub-tree will contain only nodes with values smaller than it. And the right su