Abstract
Binary search trees and AVL trees are a category of binary trees that facilitate efficient retrievals. This chapter discusses the definition of a binary search tree and its operations, viz., retrieval, insertion, and deletion. It also discusses the definition of the AVL search tree and the operations of retrieval, insertion and deletion on the tree. A binary search tree is an excellent candidate for the representation of both static and dynamic symbol tables considering its O(log n) average case complexity for insert, delete and retrieval operations. The application of binary search trees for the representation of keyword symbol table in compiler design can be probed further to bring in the application of AVL search trees as well. It is known that for a given set K of keywords, a finite set of binary search trees may be constructed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
