Deletions in random binary search trees: a story of errors
From MaRDI portal
Publication:972839
DOI10.1016/J.JSPI.2010.01.028zbMATH Open1278.68081OpenAlexW1970716997MaRDI QIDQ972839FDOQ972839
Authors: 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
Recommendations
- Analysis of the standard deletion algorithms in exact fit domain binary search trees
- Randomness Preserving Deletions on Special Binary Search Trees
- Randomized 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unifying look at data structures
- Randomized search trees
- Randomized binary search trees
- Distribution of distances in random binary search trees.
- Deletions That Preserve Randomness
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- The height of a random binary search tree
- A trivial algorithm whose analysis is not: a continuation
- A trivial algorithm whose analysis isn't
- Trees, Forests and Rearranging
- On the efficiency of a new method of dictionary construction
- Analysis of the standard deletion algorithms in exact fit domain binary search trees
Cited In (5)
This page was built for publication: Deletions in random binary search trees: a story of errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972839)
