On binary search trees
From MaRDI portal
Publication:2366072
DOI10.1016/0020-0190(93)90212-RzbMath0771.68042MaRDI 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
Related Items
Optimal binary search trees, An approximation algorithm for binary searching in trees, New lower bounds on the cost of binary search trees, Operations research applications of dichotomous search, A strategy for searching with different access costs., Efficient Construction of Near-Optimal Binary and Multiway Search Trees, Reflections on Optimal and Nearly Optimal Binary Search Trees
Cites Work