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 algorithm to find the maximum path length binary trees of a given size and fringe thickness.
منابع مشابه
Extremal Weighted Path Lengths in Random Binary Search Trees
We consider weighted path lengths to the extremal leaves in a random binary search tree. When linearly scaled, the weighted path length to the minimal label has Dickman’s infinitely divisible distribution as a limit. By contrast, the weighted path length to the maximal label needs to be centered and scaled to converge to a standard normal variate in distribution. The exercise shows that path le...
متن کاملMinimal and maximal plateau lengths in Motzkin paths
The minimal length of a plateau (a sequence of horizontal steps, preceded by an upand followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat this and the related parameters maximal plateau length, minimal horizontal segment and maximal horizontal segment as well as some similar parame...
متن کاملTight Upper and Lower Bounds on the Path Length of Binary Trees
The external path length of a tree T is the sum of the lengths of the paths from the root to each external node. The maximal path length diierence, , is the diierence between the length of the longest and shortest such path. We prove tight lower and upper bounds on the external path length of binary trees with N external nodes and prescribed maximal path length diierence. In particular, we give...
متن کاملEnumeration of Binary Trees and Universal Types
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number. Over the years various interesting questions about the statistics of such trees were investigated (e.g., height and path length distributions for a randomly selected tree). Binary trees find an abundance of...
متن کاملWell-partial-orderings and hierarchies of binary trees
The set of binary trees together with the homeomorphic embedding build an wellpartial-ordering. It is well known that its maximal order type is ε0 as shown by de Jongh and that its canonical linearization is the system obtained from the celebrated Feferman-Schütte system for Γ0 by omitting the addition operator. We show here that Higman’s Lemma and Dershowitz’s recursive path ordering are nice ...
متن کامل