Tight Upper and Lower Bounds on the Path Length of Binary Trees
暂无分享,去创建一个
The external path length of a tree $T$ is the sum of the lengths of the paths from the root to each external node. The maximal path length difference, $\Delta$, is the difference between the lengths of the longest and shortest such paths.
Tight lower and upper bounds are proved on the external path length of binary trees with $N$ external nodes and maximal path length difference $\Delta$ is prescribed.
In particular, an upper bound is given that, for each value of $\Delta$, can be exactly achieved for infinitely many values of $N$. This improves on the previously known upper bound that could only be achieved up to a factor proportional to $N$. An elementary proof of the known upper bound is also presented as a preliminary result.
Moreover, a lower bound is proved that can be exactly achieved for each value of $N$ and $\Delta\leq N/2$.
[1] W. Specht. Zur Theorie der elementaren Mittel , 1960 .
[2] Chak-Kuen Wong,et al. Upper Bounds for the Total Path Length of Binary Trees , 1973, JACM.
[3] Richard W. Hamming,et al. Coding and Information Theory , 1980 .
[4] Derick Wood,et al. On the path length of binary trees , 1989, JACM.
[5] Alfredo De Santis,et al. Tight Bounds on the Path Length of Binary Trees , 1991, STACS.