howeverthe demerits of splay trees includewhile sequentially accessing all the nodes of tree in sorted orderthe resultant tree becomes completely unbalanced this takes accesses of the tree in which each access takes (log ntime for examplere-accessing the first node triggers an operation that in turn takes (noperations to rebalance the tree before returning the first node although this creates significant delay for the final operationthe amortized performance over the entire sequence is still (log nfor uniform accessthe performance of splay tree will be considerably worse than somewhat balanced simple binary search tree for uniform accessunlike splay treesthese other data structures provide worst-case time guarantees and can be more efficient to use points to remember binary search treealso known as an ordered binary treeis variant of binary tree in which all the nodes in the left sub-tree have value less than that of the root node and all the nodes in the right sub-tree have value either equal to or greater than the root node the average running time of search operation is (log nhoweverin the worst casea binary search tree will take (ntime to search an element from the tree mirror image of binary search tree is obtained by interchanging the left sub-tree with the right sub-tree at every node of the tree in threaded binary treenull entries can be replaced to store pointer to either the in-order predecessor or in-order successor of node one-way threaded tree is also called single threaded tree in two-way threaded treealso called double threaded treethreads will appear in both the left and the right field of the node an avl tree is self-balancing tree which is also known as height-balanced tree each node has balance factor associated with itwhich is calculated by subtracting the height of the right sub-tree from the height of the left sub-tree in height balanced treeevery node has balance factor of either or - red-black tree is self-balancing binary search tree which is also called as 'symmetric binary -treealthough red-black tree is complexit has good worst case running time for its operations and is efficient to useas searchinginsertionand deletion can all be done in (log ntime splay tree is self-balancing binary search tree with an additional property that recently accessed elements can be re-accessed fast exercises review questions explain the concept of binary search trees explain the operations on binary search trees how does the height of binary search tree affect its performance how many nodes will complete binary tree with nodes have in the last levelwhat will be the height of the tree write short note on threaded binary trees why are threaded binary trees called efficient binary treesgive the merits of using threaded binary tree discuss the advantages of an avl tree how is an avl tree better than binary search tree how does red-black tree perform better than binary search tree list the merits and demerits of splay tree create binary search tree with the input given below (ainsert and into the tree (bdelete values and from the tree