Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms
Information Processing Letters
Randomized binary search trees
Journal of the ACM (JACM)
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)
An empirical study of insertion and deletion in binary search trees
Communications of the ACM
Randomized binary search technique
Communications of the ACM
Concrete Math
Emerging Behavior as Binary Search Trees Are Symmetrically Updated
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Deletion in binary storage trees.
Deletion in binary storage trees.
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
| Hi-index | 0.00 |
When repeated updates are made to a binary search tree, the expected search cost tends to improve, as observed by Knott. For the case in which the updates use an asymmetric deletion algorithm, the Knott effect is swamped by the behavior discovered by Eppinger. The Knott effect applies also to updates using symmetric deletion algorithms, and it remains unexplained, along with several other trends in the tree distribution. It is believed that updates using symmetric deletion do not cause search cost to deteriorate, but the evidence is all experimental. The contribution of this paper is to model separately several different trends which may contribute to or detract from the Knott effect, including a previously unreported centripetal tendency.