Abstract
Son-trees can be used as node search trees. A new insertion algorithm is given for son-trees used as node search trees. Random son-trees, obtained by random insertions starting with the empty tree, are studied, when the new insertion algorithm is used. The results are compared to known results about another insertion algorithm. The old insertion algorithm will give trees with better storage utilization, but the new insertion algorithm will need less restructurings.
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.
