Vijay K. Naik, Sanjeev K. Setia, et al.
Journal of Parallel and Distributed Computing
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. © 1973, ACM. All rights reserved.
Vijay K. Naik, Sanjeev K. Setia, et al.
Journal of Parallel and Distributed Computing
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence