Restructuring binary search trees revisited

DOI10.1016/J.IPL.2005.03.014zbMath1185.68273OpenAlexW2135202610MaRDI QIDQ1041801

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

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Optimal alphabetic search trees with restricted maximal height
• Nearly optimal binary search trees
• Optimum binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Optimal Alphabetic Trees
• A Best Possible Bound for The Weighted Path Length of Binary Search Trees
• Optimal Binary Search Trees with Restricted Maximal Depth
• Restructuring ordered binary trees
• On Information and Sufficiency

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