Self-adjusting binary search trees
Journal of the ACM (JACM)
Height restricted optimal binary trees
SIAM Journal on Computing
A fast algorithm for optimal length-limited Huffman codes
Journal of the ACM (JACM)
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Restructuring binary search trees revisited
Information Processing Letters
Note: Compressed depth sequences
Theoretical Computer Science
Restructuring binary search trees revisited
Information Processing Letters
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
A New Algorithm for Building Alphabetic Minimax Trees
Fundamenta Informaticae - Special Issue on Stringology
Minimax trees in linear time with applications
European Journal of Combinatorics
| Hi-index | 0.00 |
We consider the problem of restructuring an ordered binary tree T, preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restructuring necessarily involves the downward displacement of some of the nodes of T. Our results, focusing both on the maximum displacement over all nodes and on the maximum displacement over leaves only, provide (i) an explicit tradeoff between the worst-case displacement and the height restriction (including a family of trees that exhibit the worst-case displacements) and (ii) efficient algorithms to achieve height-restricted restructuring while minimizing the maximum node displacement.