Tree rebalancing in optimal time and space
Communications of the ACM
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficient algorithms to globally balance a binary search tree
Communications of the ACM
Balancing binary trees by internal path reduction
Communications of the ACM
Performance of height-balanced trees
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
Fringe analysis of binary search trees with miniml internal path length
CSC '91 Proceedings of the 19th annual conference on Computer Science
| Hi-index | 48.22 |
This paper presents an insertion algorithm for maintaining a binary search tree with minimal internal path length. The insertion algorithm maintains minimal internal path length by displacing keys when necessary, in an inorder fashion, until a vacant position is found in the last incomplete level of the tree. The algorithm produces trees that are optimal for searching while exhibiting a runtime behavior that is between logarithmic and linear in the number of nodes in the tree, with linear time being its worst-case behavior.