Purely top-down updating algorithms for stratified search trees (Q1057067)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Purely top-down updating algorithms for stratified search trees |
scientific article; zbMATH DE number 3896321
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Purely top-down updating algorithms for stratified search trees |
scientific article; zbMATH DE number 3896321 |
Statements
Purely top-down updating algorithms for stratified search trees (English)
0 references
1985
0 references
The problem studied is the problem of existence of purely top-down updating algorithms for search trees. The authors present such algorithms for internal- and external-search trees in the framework of stratified search trees. In the case of external-search trees four routing schemes are considered: the left-maximum scheme, the right-maximum scheme, the \((\leq,<)\) scheme and the \((<,<)\) scheme.
0 references
binary search trees
0 references
purely top-down updating algorithms
0 references
stratified search trees
0 references
routing schemes
0 references
