notes you have -tree of order in figure given below explain to delete from it there are possible ordered sequences of the four keys but only distinct binary trees with four nodes thereforethese binary trees are not equally likely to occur as search trees find which one of the binary search trees corresponds to each of the possible ordered sequences of thereby find the probability for building each of the binary search trees from randomly ordered input " node containing keys always also contains + pointers discuss "the split operation transforms full node with keys into two nodes with keys eachexplain explain the process of deletion of key from -tree with the help of suitable example binary trees are defined recursivelyalgorithms for manipulating binary trees are usually best written recursively in programming with binary treesbe aware of the problems generally associated with recursive algorithms be sure that your algorithm terminates under any condition and that it correctly treats the trivial case of an empty tree answersself assessment ( ( analogous database depth -tree-create true false true true further readings books brian kernighan and dennis ritchiethe programming languageprentice hall burkhard moniendata structures and efficient algorithmsthomas ottmannspringer krusedata structure program designprentice hall of indianew delhi mark allen welesdata structure algorithm analysis in csecond ed addisonwesley publishing rg dromeyhow to solve it by computercambridge university press lovely professional university