- the rules for deletion in an avl tree specifically require that when the two subtrees of the node denoted as have equal heightchild should be chosen to be "alignedwith (so that and are both left children or both right childrento better understand this requirementrepeat exercise assuming we picked the misaligned choice of why might there be problem in restoring the avl property with that choicer- perform the following sequence of operations in an initially empty splay tree and draw the tree after each set of operations insert keys in this order search for keys in this order delete keys in this order - what does splay tree look like if its entries are accessed in increasing order by their keysr- is the search tree of figure (aa ( treewhy or why notr- an alternative way of performing split at node in ( tree is to partition into and with being -node and -node which of the keys or do we store at ' parentwhyr- dr amongus claims that ( tree storing set of entries will always have the same structureregardless of the order in which the entries are inserted show that he is wrong - draw four different red-black trees that correspond to the same ( tree - consider the set of keys { draw ( tree storing as its keys using the fewest number of nodes draw ( tree storing as its keys using the maximum number of nodes - consider the sequence of keys ( draw the result of inserting entries with these keys (in the given orderinto an initially empty ( tree an initially empty red-black tree - for the following statements about red-black treesprovide justification for each true statement and counterexample for each false one subtree of red-black tree is itself red-black tree node that does not have sibling is red there is unique ( tree associated with given red-black tree there is unique red-black tree associated with given ( tree - explain why you would get the same output in an inorder listing of the entries in binary search treet independent of whether is maintained to be an avl treesplay treeor red-black tree