Average depth in a binary search tree with repeated keys

MaRDI QIDQ3575002zbMATH OpenFDO

Authors Margaret Archibald, Julien Clément

Publication date 5 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0122/0.html

zbMATH Keywords

shuffle productmultisetbinary search treesaverage case analysisrepeated keys

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10)

Recommendations

• Binary search trees constructed from nondistinct keys with/without specified probabilities
• A note on the height of binary search trees
• Random suffix search trees
• scientific article; zbMATH DE number 1984548
• On the Generation of Random Binary Search Trees

Cited in

(2)

• Weighted height of random trees
• Depth of a random binary search tree with concurrent insertions

This page was built for publication: Average depth in a binary search tree with repeated keys

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