The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
Deletion in binary storage trees.
Deletion in binary storage trees.
Tree rebalancing in optimal time and space
Communications of the ACM
The effect of updates in binary search trees
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
Randomized binary search trees
Journal of the ACM (JACM)
Emerging behavior as binary search trees are symmetrically updated
Theoretical Computer Science - Latin American theoretical informatics
Data structures from an empirical standpoint
Journal of Computing Sciences in Colleges
Randomized insertion and deletion in point quad trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 48.23 |
This paper describes an experiment on the effect of insertions and deletions on the path length of unbalanced binary search trees. Repeatedly inserting and deleting nodes in a random binary tree yields a tree that is no longer random. The expected internal path length differs when different deletion algorithms are used. Previous empirical studies indicated that expected internal path length tends to decrease after repeated insertions and asymmetric deletions. This study shows that performing a larger number of insertions and asymmetric deletions actually increases the expected internal path length, and that for sufficiently large trees, the expected internal path length becomes worse than that of a random tree. With a symmetric deletion algorithm, however, the experiments indicate that performing a large number of insertions and deletions decreases the expected internal path length, and that the expected internal path length remains better than that of a random tree.