An evaluation of self‐adjusting binary search tree techniques
- 1 April 1993
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 23 (4) , 369-382
- https://doi.org/10.1002/spe.4380230403
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Tree rebalancing in optimal time and spaceCommunications of the ACM, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Efficient algorithms to globally balance a binary search treeCommunications of the ACM, 1984
- Heuristics That Dynamically Organize Data StructuresSIAM Journal on Computing, 1979
- Self-Organizing Binary Search TreesJournal of the ACM, 1978
- Weight-balanced treesPublished by Association for Computing Machinery (ACM) ,1975
- Binary Search Trees of Bounded BalanceSIAM Journal on Computing, 1973