D. S. Hirschberg
Abstract
A restriction on height-balanced binary trees is presented. It is seen that this restriction reduces the extra memory requirements by half (from two extra bits per node to one) and maintains fast search capabilities at a cost of increased time requirements for inserting new nodes.
- 1 Adel'son-Vel'skii, G.M., and Landis, E.M. Doklady Akademia Nauk SSSR 146 (1962), 263-266; English translation in Soy. Math. 6 (1963), 1259-1263.Google Scholar
- 2 Knuth, D.E. The Art of Computer Programming, Volume Ill: Sorting and Searching" Addison-Wesley, Reading, Mass., 1973, pp. 451-457, 471. Google ScholarDigital Library
- 3 Nievergelt, J. Binary Search Trees and File Organization. Computing Surveys 6, 3 (Sept. 1974), 195-207. Google ScholarDigital Library
- 4 Karlton, P.L., Fuller, S.H., Scroggs, R.E., and Kaehler, E.B. Performance of height-balanced trees" Comm. ACM 19, 1 (Jan. 1976), 23-28. Google ScholarDigital Library
Index Terms
- An insertion technique for one-sided height-balanced trees
Recommendations
An optimal method for deletion in one-sided height-balanced trees
A one-sided height-balanced tree is a binary tree in which every node's right subtree has a height which is equal to or exactly one greater than the height of its left subtree. It has an advantage over the more general AVL tree in that only one bit of ...
Insertions and deletions in one-sided height-balanced trees
Recently Hirschberg has established that insertions into one-sided height-balanced trees can be done in O(log2N) steps. It is proved here that deletions can also be performed in O(log2N) steps, which answers the open problem posed by Hirschberg.
An optimal insertion algorithm for one-sided height-balanced binary search trees
An algorithm for inserting an element into a one-sided height-balanced (OSHB) binary search tree is presented. The algorithm operates in time O(log n), where n is the number of nodes in the tree. This represents an improvement over the best previously ...
Comments