Expected Costs in Some Classes of Binary Search Trees

DOI10.1080/02522667.1984.10698792zbMath0555.68038OpenAlexW1971429881MaRDI QIDQ3219127

Hajime Fukushima

Publication date: 1984

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1984.10698792

zbMATH Keywords

random treesbinary search treesexpected costaverage path lengths

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Unnamed Item
• Self-Organizing Binary Search Trees
• Heuristics That Dynamically Organize Data Structures
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

This page was built for publication: Expected Costs in Some Classes of Binary Search Trees