Updating a balanced search tree in O(1) rotations
- 10 June 1983
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 16 (5), 253-257
- https://doi.org/10.1016/0020-0190(83)90099-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A new data structure for representing sorted listsActa Informatica, 1982
- A new class of balanced search trees : half-balanced binary search tressRAIRO. Informatique théorique, 1982
- Hysterical B-treesInformation Processing Letters, 1981
- Symmetric binary B-Trees: Data structure and maintenance algorithmsActa Informatica, 1972