Abstract
This work is inspired by a paper by Mandelbrot and Frame [1], in which they describe properties of symmetric binary branching trees. We study a variation of their trees in which non-uniform scaling is applied, focusing on geometric properties such as path length and tree height. We also discuss the computer implementation via Mathematica.
Citation
Amelia O'Hanlon. Patricia Howard. David A. Brown. "Path Length and Height in Asymmetric Binary Branching Trees." Missouri J. Math. Sci. 16 (2) 88 - 103, Spring 2004. https://doi.org/10.35834/2004/1602088
Information
