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 elimination tree plays an important role in many aspects of sparse matrix factorization. The height of the elimination tree presents a rough, but usually eeective, measure of the time needed to perform parallel elimination. Finding orderings that produce low elimination trees is therefore important. As the problem of nding minimum height elimination tree orderings is NP-hard, it is interest...

Due to the importance of Acer monspessulanum in Iranian mountain forests, a study was carried out to reliably estimate its woody biomass and growing volume via allometric equations. Four transects, five trees in each were chosen randomly. The characteristics of standing trees including: diameter at root collar, height, number of stems and crown width were measured, then trees were finally cut d...