On binary search trees

DOI10.1016/0020-0190(93)90212-RMaRDI QIDQ2366072zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms and Computation
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• scientific article; zbMATH DE number 4047146
• Optimal binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees

Cites work

• scientific article; zbMATH DE number 4210044 (Why is no real title available?)
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Nearly optimal binary search trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Cited in

(25)

• An approximation algorithm for binary searching in trees
• Reflections on Optimal and Nearly Optimal Binary Search Trees
• Optimal binary search trees
• scientific article; zbMATH DE number 4047146 (Why is no real title available?)
• An estimate of mean efficiency of search trees for arbitrary sets of binary words
• Online binary minimax trees
• Multi-Finger Binary Search Trees
• scientific article; zbMATH DE number 2011834 (Why is no real title available?)
• Binary search trees: How low can you go?
• A new genetic approach to construct near-optimal binary search trees
• Binary search tree recursions with harmonic toll functions
• Operations research applications of dichotomous search
• Searching Trees: An Essay
• The estimated cost of a search tree on binary words
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• New lower bounds on the cost of binary search trees
• Heuristics for optimum binary search trees and minimum weight triangulation problems
• Algorithms and Computation
• Onq-trees
• scientific article; zbMATH DE number 844505 (Why is no real title available?)
• scientific article; zbMATH DE number 1552324 (Why is no real title available?)
• scientific article; zbMATH DE number 3845369 (Why is no real title available?)
• A strategy for searching with different access costs.
• Assembling approximately optimal binary search trees efficiently using arithmetics
• Binary search trees with binary comparison cost

This page was built for publication: On binary search trees

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