Random binary search tree with equal elements

DOI10.1016/J.TCS.2010.06.023MaRDI QIDQ604469zbMATH OpenOpenAlexFDO

Authors Tomi A. Pasanen

Publication date 11 November 2010

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

Full work available at URL https://doi.org/10.1016/j.tcs.2010.06.023

zbMATH Keywords

data structuresequal elementsmonosetmultisetrandom binary search tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Randomized binary search trees
• Randomization of search trees by subtree size
• Randomness Preserving Deletions on Special Binary Search Trees
• Maintaining Ideally Distributed Random Search Trees without Extra Space
• Randomized search trees

Cites work

• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• Randomized binary search trees
• Randomized search trees

Cited in

(2)

• Randomized binary search trees
• Randomization of search trees by subtree size

This page was built for publication: Random binary search tree with equal elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604469)