The \(m\)-version of binary search trees: an average case analysis

DOI10.1155/2013/450627zbMath1264.05030OpenAlexW1973074590WikidataQ58996961 ScholiaQ58996961MaRDI QIDQ1952717

Prodinger, Helmut

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/450627

zbMATH Keywords

binary search treesinternal path lengthcost of successful searchcost of unsuccessful search

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Uses Software

• Find

Cites Work

• Approximate counting: a detailed analysis
• Linear probing and graphs
• Comparisons in Hoare's Find Algorithm
• Randomized binary search technique
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(m\)-version of binary search trees: an average case analysis