Restructuring ordered binary trees
From MaRDI portal
Publication:4820879
DOI10.1016/S0196-6774(03)00094-4zbMath1067.68101OpenAlexW3139427590MaRDI QIDQ4820879
David G. Kirkpatrick, William S. Evans
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
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (4)
Minimax trees in linear time with applications ⋮ Efficient and compact representations of some non-canonical prefix-free codes ⋮ Compressed depth sequences ⋮ Restructuring binary search trees revisited
This page was built for publication: Restructuring ordered binary trees
