Affiliation:
1. Univ. of Massachusetts, Amherst, MA
Abstract
A generalization of AVL trees is proposed in which imbalances up to Δ are permitted, where Δ is a small integer. An experiment is performed to compare these trees with standard AVL trees and with balanced trees on the basis of mean retrieval time, of amount of restructuring expected, and on the worst case of retrieval time. It is shown that, by permitting imbalances of up to five units, the retrieval time is increased a small amount while the amount of restructuring required is decreased by a factor of ten.
A few theoretical results are derived, including the correction of an earlier paper, and are duly compared with the experimental data. Reasonably good correspondence is found.
Publisher
Association for Computing Machinery (ACM)
Reference9 articles.
1. An algorithm for the organization of information;Adel'son-Vel'skiy G.M.;Doklady Akad. Nauk USSR Moscos,1962
2. Information retrieval
3. Optimizing binary trees grown with a sorting algorithm
4. Stone H. bttroduction to Computer Organization and Data Structures McGraw-Hill New York 1972. Stone H. bttroduction to Computer Organization and Data Structures McGraw-Hill New York 1972.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献