Abstract
We discuss the relationships of the classes of height-balanced (search) trees and the classes of brother (search) trees. In particular we characterize each class of height-balanced trees in terms of the class of “corresponding” brother trees and vice versa. Secondly, we show how this characterization leads to the notion of nonstandard updating algorithms. We derive a nonstandard insertion algorithm for height-balanced search trees to illustrate the notion. Finally we consider something of the similarities and differences between the standard and nonstandard insertion algorithms for height-balanced search rees.
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.
