Analysis of the standard deletion algorithms in exact fit domain binary search trees
- 1 June 1990
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 5 (1-4) , 295-311
- https://doi.org/10.1007/bf01840390
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and SimulationsThe Computer Journal, 1989
- The effect of updates in binary search treesPublished by Association for Computing Machinery (ACM) ,1985
- An empirical study of insertion and deletion in binary search treesCommunications of the ACM, 1983
- A trivial algorithm whose analysis isn'tJournal of Computer and System Sciences, 1978
- Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingJournal of the ACM, 1962
- On the efficiency of a new method of dictionary constructionInformation and Control, 1960
- Trees, Forests and RearrangingThe Computer Journal, 1960