Deletions in random binary search trees: a story of errors

DOI10.1016/J.JSPI.2010.01.028zbMath1278.68081OpenAlexW1970716997MaRDI QIDQ972839

Wolfgang Panny

Publication date: 21 May 2010

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2010.01.028

zbMATH Keywords

analysis of algorithmsrandom binary search treedeletions

Mathematics Subject Classification ID

Combinatorial probability (60C05) Data structures (68P05)

Related Items (1)

A class of random recursive tree algorithms with deletion

Cites Work

• 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
• A trivial algorithm whose analysis isn't
• Distribution of distances in random binary search trees.
• Randomized search trees
• Trees, Forests and Rearranging
• On the efficiency of a new method of dictionary construction
• The height of a random binary search tree
• Randomized binary search trees
• A unifying look at data structures
• Deletions That Preserve Randomness
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: Deletions in random binary search trees: a story of errors