The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Journal of the ACM (JACM)
Information Theory and Reliable Communication
Information Theory and Reliable Communication
On the path length of binary trees
Journal of the ACM (JACM)
Binary Search Trees and File Organization
ACM Computing Surveys (CSUR)
ACM '78 Proceedings of the 1978 annual conference
An empirical evaluation of algorithms for dynamically maintaining binary search trees
ACM '80 Proceedings of the ACM 1980 annual conference
Binary search trees and file organization
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Nordic Journal of Computing
Dichotomic Search Protocols for Constrained Optimization
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Dynamic matchings in convex bipartite graphs
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |
Two upper bounds for the total path length of binary trees are obtained. One is for node-trees, and bounds the internal (or root-to-node) path length; the other is for leaf-trees, and bounds the external (or root-to-leaf) path length. These bounds involve a quantity called the balance, which allows the bounds to adapt from the n log n behavior of a completely balanced tree to the n2 behavior of a most skewed tree. These bounds are illustrated for the case of Fibonacci trees.