Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI