SODA
2000
ACM
13 years 6 months ago
2000
ACM
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 restru...