of the recursion since the tree can be no higher than log and each split is constant time operationthe worst case time of an insertion is also (log nexercises prove or explain why the bstremove(method requires (ntime in the worst case why can new keys not be inserted into the interior nodes of - tree consider the following set of values and use them to build the indicated type of tree by adding one value at time in the order listed (abinary search tree (bavl tree ( - tree repeat exercise but for the following set of keyst given the following binary treesindicate which trees are height balanced ( ( ( ( ( consider the binary search tree below and show the resulting tree after deleting each of the following keys and