Open AccessPath Length and Height in Asymmetric Binary Branching Trees
Author(s) -
Amelia O'Hanlon,
Patricia A. Howard,
David A. Brown
Publication year - 2004
Publication title -
missouri journal of mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.239
H-Index - 10
eISSN - 1085-2581
pISSN - 0899-6180
DOI - 10.35834/2004/1602088
Subject(s) - branching (polymer chemistry) , binary tree , random binary tree , binary number , mandelbrot set , mathematics , path (computing) , ternary search tree , weight balanced tree , scaling , path length , variation (astronomy) , tree (set theory) , algorithm , binary search tree , geometry , combinatorics , computer science , tree structure , physics , interval tree , mathematical analysis , arithmetic , fractal , computer network , materials science , astrophysics , composite material , programming language