Height is one of the most important dimensions of trees, but few observers are fully aware of the consequences of the misapplication of conventional height measurement techniques. A new approach, the sine method, can improve height measurement by being less sensitive to the requirements of conventional techniques (similar triangles and the tangent method). We studied the sine method through a c...

directional felling of trees plays a key role in reducing of damages to forest residual trees and can also facilitate skidding. the aim of this study was presents a practical linear model for estimation of tree falling direction error in an uneven-aged mixed stand in northern forests of iran. to conduct the study a number of 95 trees of four species fagus orientalis lipsky, carpinus betulus l.,...

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...

First, we present a simple algorithm which, given a sorted sequence of node values, can build a binary search tree of minimum height in O(N) time. The algorithm works with sequences whose length is, a priori, unknown. Previous algorithms [1-3] required the number of elements to be known in advance. Although the produced trees are of minimum height, they are generally unbalanced. We then show ho...

evaluating the forest stands structure in different development stages is one of the ways for better understanding the forest dynamics and its response to natural disturbances. this study was carried out in the compartment 319, kheiroud forest in order to quantify the structure properties of mixed beech stands in the stem exclusion phase. for this purpose, three one-hectare sample plots were se...

An ordered tree with height h is b-balanced if all its leaves have a level ` with h − b ≤ ` ≤ h, where at least one leaf has a level equal to h− b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall de...