Path Length and Height in Asymmetric Binary Branching Trees
نویسندگان
چکیده
منابع مشابه
The Maximal Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the difference between the length of a shortest root-to-leaf path and the height). We characterize the maximum path length binary trees of a given height, size, and fringe thickness. Using this characterization, we give an a...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملThe Average Height of Binary Trees and Other Simple Trees
The average height of a binary tree with n internal nodes is shown to be asymptotic to 2 6. This represents the average stack height of the simplest recursive tree traversal algorithm. The method used in this estimation is also applicable to the analysis of traversal algorithms of unary-binary trees, unbalanced 2-3 trees, t-ary trees for any t, and other families of trees. It yields the two pre...
متن کاملThe Height of Binary Search Trees
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملThe Height of q-Binary Search Trees
The paper [8] introduces for the first time a meaningful q–model of binary search trees: instead of binary search trees, one considers tournament trees, which differ only marginally from binary search trees; if one starts from a permutation ( 1 2 ··· n π1 π2 ··· πn ) , then one inserts the number i instead of the number πi. Thus, traversing the tree in inorder, we might think of the associated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Missouri Journal of Mathematical Sciences
سال: 2004
ISSN: 0899-6180
DOI: 10.35834/2004/1602088