Abstract
Given a cost measure for some class of trees, we are interested in characterizing the trees that attain the minimal or maximal cost amongst all trees of the same size. We present our latest results in this area for the classes of AVL trees and brother trees, and for the cost measures based on binary comparisons and node visits. We also briefly consider the space cost measure for brother trees and the unbalance cost measure for AVL trees.
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.
