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
An insertion technique for one-sided height-balanced trees
Communications of the ACM
Communications of the ACM
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Rebalancing Height Balanced Trees
IEEE Transactions on Computers
Maintaining Sorted Files in a Magnetic Bubble Memory
IEEE Transactions on Computers
A Tree Storage Scheme for Magnetic Bubble Memories
IEEE Transactions on Computers
Traversing Binary Tree Structures with Shift-Register Memories
IEEE Transactions on Computers
On the Height of Height-Balanced Trees
IEEE Transactions on Computers
The Generation of Permutations in Magnetic Bubble Memories
IEEE Transactions on Computers
| Hi-index | 14.99 |
In this paper we analyze various search schemes in a major/minor loop bubble memory. Specifically, we study balanced tree search, one-sided height-balanced tree search, and one-sided K-Keight-balanced tree search. Two parameters are of interest in the present framework, namely, the number of comparisons and the amount of record movement required for a search. One-sided height- balanced tree search seems to offer the best compromise. Other related issues such as insertion and deletions are also discussed.