Affiliation:
1. Massachusetts Institute of Technology, Cambridge, MA
Abstract
Items can be retrieved from binary trees grown with a form of the Algorithm Quicksort in an average time proportional to log
n
, where
n
is the number of items in the tree. The binary trees grown by this algorithm sometimes have some branches longer than others; therefore, it is possible to reduce the average retrieval time by restructuring the tree to make the branches as uniform in length as possible. An algorithm to do this is presented. The use of this algorithm is discussed, and it is compared with another which restructures the tree after each new item is added.
Publisher
Association for Computing Machinery (ACM)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure;Proceedings of the VLDB Endowment;2024-02
2. A Novel Binary Search Tree Method to Find an Item Using Scaling;The International Arab Journal of Information Technology;2022
3. Hybrid Recommendation System using Particle Swarm Optimization and User Access Based Ranking;Proceedings of the International Conference on Informatics and Analytics;2016-08-25
4. Bibliography;Sorting;2011-10-26
5. A Survey on Maintaining Binary Search Tree in Optimal Shape;2009 International Conference on Information Management and Engineering;2009-04