Optimizing binary trees grown with a sorting algorithm

Authors:
W. A. Martin;D. N. Ness
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Communications of the ACM
Year:
1972

Citing 4
Cited 18

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Algorithm 63: partition

Communications of the ACM
A balanced tree storage and retrieval algorithm

SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
Information retrieval: information storage and retrieval using AVL trees

ACM '65 Proceedings of the 1965 20th national conference

Tree rebalancing in optimal time and space

Communications of the ACM
An insertion algorithm for a minimal internal path length binary search tree

Communications of the ACM
A compendium of key search references

ACM SIGIR Forum
A Modified List Technique Allowing Binary Search

Journal of the ACM (JACM)
Efficiency of a Binary Comparison Storage Technique

Journal of the ACM (JACM)
Sorting

ACM Computing Surveys (CSUR)
Efficient algorithms to globally balance a binary search tree

Communications of the ACM
A comparison of tree-balancing algorithms

Communications of the ACM
Performance of height-balanced trees

Communications of the ACM
Optimum data base reorganization points

Communications of the ACM
A generalization of AVL trees

Communications of the ACM
Balancing methods for binary search trees

ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
A new method for updating and rebalancing tree-type main memory dictionaries

Nordic Journal of Computing
The relational data management system: A perspective

SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Opportunities for data base reorganization

ACM SIGMOD Record
Experiments with balanced-sample binary trees

Proceedings of the 36th SIGCSE technical symposium on Computer science education
Matrix storage schemes in linear programming

ACM SIGMAP Bulletin
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	48.33

Visualization

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.