applications of avl trees notes avl trees are applied in the following situations there are few insertion and deletion operations short search time is needed input data is sorted or nearly sorted avl tree structures can be used in situations which require fast searching butthe large cost of rebalancing may limit the usefulness consider the following classic problem in computer science is how to store information dynamically so as to allow for quick look up this searching problem arises often in dictionariestelephone directorysymbol tables for compilers and while storing business records etc the records are stored in balanced binary treebased on the keys (alphabetical or numericalorder the balanced nature of the tree limits its height to (log )where is the number of inserted records avl trees are very fast on searches and replacements buthave moderately high cost for addition and deletion if application does lot more searches and replacements than it does addition and deletionsthe balanced (avlbinary tree is good choice for data structure avl tree also has applications in file systems summary binary trees provide an excellent solution to this problem by making the entries of an ordered list into the nodes of binary treewe shall find that we can search for target key in (log nstepsjust as with binary searchand we shall obtain algorithms for inserting and deleting entries also in time (log nz when we studied binary searchwe drew comparison trees showing the progress of binary search by moving either left (if the target key is smaller than the one in the current node of the treeor right (if the target key is largerz we can regard binary search trees as new abstract data type with its own definition and its own methodsz since binary search trees are special kinds of binary treeswe may consider their methods as special kinds of binary tree methodsz since the entries in binary search trees contain keysand since they are applied for information retrieval in the same way as ordered listswe may study binary search trees as new implementation of the abstract data type ordered list keywords binary search treea binary search tree is binary tree which may be emptyand every node contains an identifier searchingsearching for the key in the given binary search treestart with the root node and compare the key with the data value of the root node lovely professional university