Restructuring binary search trees revisited

DOI10.1016/J.IPL.2005.03.014MaRDI QIDQ1041801zbMATH OpenOpenAlexFDO

Authors Travis Gagie

Publication date 4 December 2009

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

Full work available at URL https://doi.org/10.1016/j.ipl.2005.03.014

zbMATH Keywords

data structures

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• scientific article; zbMATH DE number 107482 (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
• A Mathematical Theory of Communication
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Nearly optimal binary search trees
• On Information and Sufficiency
• Optimal Alphabetic Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Optimal alphabetic search trees with restricted maximal height
• Optimum binary search trees
• Restructuring ordered binary trees

This page was built for publication: Restructuring binary search trees revisited

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