Restructuring ordered binary trees

DOI10.1016/S0196-6774(03)00094-4MaRDI QIDQ4820879zbMATH OpenOpenAlexFDO

Authors W. Evans, David Kirkpatrick

Publication date 1 October 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00094-4

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1445337
• Algorithms and Computation
• Height Restricted Optimal Binary Trees
• scientific article; zbMATH DE number 2170467
• Optimal binary trees with order constraints

Cited in

(6)

• Efficient and compact representations of some non-canonical prefix-free codes
• scientific article; zbMATH DE number 5130543 (Why is no real title available?)
• scientific article; zbMATH DE number 1445337 (Why is no real title available?)
• Compressed depth sequences
• Minimax trees in linear time with applications
• Restructuring binary search trees revisited

This page was built for publication: Restructuring ordered binary trees

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