The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
Performance of height-balanced trees
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Balancing binary trees by internal path reduction
Communications of the ACM
An optimal insertion algorithm for one-sided height-balanced binary search trees
Communications of the ACM
Insertions and deletions in one-sided height-balanced trees
Communications of the ACM
An optimal method for deletion in one-sided height-balanced trees
Communications of the ACM
Communications of the ACM
Communications of the ACM
Tree Search in Major/Minor Loop Magnetic Bubble Memories
IEEE Transactions on Computers
| Hi-index | 48.31 |
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.