Emerging behavior as binary search trees are symmetrically updated.

DOI10.1016/S0304-3975(02)00651-5zbMath1044.68136OpenAlexW2723533298MaRDI QIDQ1401314

D. Massart

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00651-5

zbMATH Keywords

Knott effect

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the standard deletion algorithms in exact fit domain binary search trees
• A trivial algorithm whose analysis is not: a continuation
• Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms
• A trivial algorithm whose analysis isn't
• On the number of descendants and ascendants in random search trees
• Singularity Analysis of Generating Functions
• On deletion in threaded binary trees
• Randomized binary search trees
• The theory of fringe analysis and its application to 23 trees and b-trees
• Randomized binary search technique
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: Emerging behavior as binary search trees are symmetrically updated.