On binary search trees

DOI10.1016/0020-0190(93)90212-RzbMath0771.68042OpenAlexW2022352965MaRDI QIDQ2366072

Roberto De Prisco, Alfredo De Santis

Publication date: 29 June 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90212-r

zbMATH Keywords

binary search treesaverage search time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (7)

New lower bounds on the cost of binary search trees ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ Operations research applications of dichotomous search ⋮ An approximation algorithm for binary searching in trees ⋮ Optimal binary search trees ⋮ Reflections on Optimal and Nearly Optimal Binary Search Trees ⋮ A strategy for searching with different access costs.

Cites Work

• Nearly optimal binary search trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On binary search trees