data structures using consider the binary search tree given below now do the following operationsfind the result of in-orderpre-orderand post-order traversals show the deletion of the root node insert and in the tree balance the avl trees given below create an avl tree using the following sequence of data draw all possible binary search trees of and programming exercises consider the avl tree given below and insert and in it delete nodes and from the avl tree formed after solving the above question - - discuss the properties of red-black tree explain the insertion cases explain splay trees in detail with relevant examples provide the memory representation of the binary tree given belowfind the result of one-way in-orderone-way pre-orderand two-way in-order threading of the tree in each casedraw the tree and also give its memory representation multiple-choice questions in the worst casea binary search tree will take how much time to search an element(ao( (bo(log (co( (do( log how much time does an avl tree take to perform searchinsertand delete operations in the average case as well as the worst case(ao( (bo(log (co( (do( log when the left sub-tree of the tree is one level higher than that of the right sub-treethen the balance factor is ( ( ( - ( which rotation is done when the new node is inserted in the right sub-tree of the right sub-tree of the critical node(all (blr (crl (drr when node is accessed it is splayed to make it the (aroot node (bparent node (cchild node (dsibling node true or false write program to insert and delete values from binary search tree write program to count the number of nodes in binary search tree in binary search treeall the nodes in the left sub-tree have value less than that of the root node