Electronic Resource
Springer
BIT
23 (1983), S. 436-455
ISSN:
1572-9125
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A parameterized binary search tree callediR tree is defined in this paper. A user is allowed to select a level of balance he desires. SR tree is a special case ofiR tree wheni=1. There are two new concepts in SR trees: (1) local balancing scheme that balances the tree locally; (2) consecutive storage for brother nodes that reduces pointer space. Although we may introduce empty nodes into the tree, we can show that only 1/8 of the nodes may be empty on the average, so it may still be advantageous in cases when record sizes are small. Insertion (and deletion) into SR trees can be done in timeh + O(1) whereh is the height of the tree. The average searching time for SR trees is shown to be 1.188 log2 k wherek is the number of keys. Generalization of the results of SR trees toiR in general is also given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01933619
|
Location |
Call Number |
Expected |
Availability |
