Efficient algorithms to create and maintain balanced and threaded binary search trees
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Multidimensional binary search trees used for associative searching
Communications of the ACM
Optimizing binary trees grown with a sorting algorithm
Communications of the ACM
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
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fringe analysis of binary search trees with miniml internal path length
CSC '91 Proceedings of the 19th annual conference on Computer Science
A new method for updating and rebalancing tree-type main memory dictionaries
Nordic Journal of Computing
| Hi-index | 48.26 |
A binary search tree can be globally balanced by readjustment of pointers or with a sorting process in O(n) time, n being the total number of nodes. This paper presents three global balancing algorithms, one of which uses folding with the other two adopting parallel procedures. These algorithms show improvement in time efficiency over some sequential algorithms [1, 2, 7] when applied to large binary search trees. A comparison of various algorithms is presented.