mandeep kaurlovely professional university unit binary search tree and avl trees notes contents objectives introduction binary search tree counting the number of nodes in binary search tree searching for target key in binary search tree deletion of node from binary search tree deletion of node with two children deletion of node with one child deletion of node with no child application of binary search tree avl tree summary keywords self assessment review questions further readings objectives after studying this unityou will be able toz describe binary search tree explain deletion of node with two child and with single child describe applications of bst introduction consider the problem of searching linked list for some target key there is no way to move through the list other than one node at timeand hence searching through the list must always reduce to sequential search as you knowsequential search is usually very slow in comparison with binary search henceassuming we can keep the keys in ordersearching becomes much faster if we use contiguous list and binary search suppose we also frequently need to make changes in the listinserting new entries or deleting old entries binary search tree binary search tree is binary tree which may be emptyand every node contains an identifier and identifier of any node in the left sub-tree is less than the identifier of the root identifier of any node in the right sub-tree is greater than the identifier of the root and the left sub-tree as well as right sub-tree both are binary search trees lovely professional university