Abstract
We initiate the study of iteratively defined classes of search trees, that is the classes of trees obtained by carrying out all possible iterative insertions into the initially empty tree, with respect to some given insertion scheme. For the well-known classes of search trees we compare their iteratively defined classes with their corresponding (statically) defined classes. Such a study sheds light on the properties of “average” trees in both classes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer & Information Sciences
Disclaimer: 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.