On the Average Height of b-Balanced Ordered Trees

author

  • Rainer Kemp
Abstract:

An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= 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 determine the exact asymptotic behaviour of the average height of such a tree together with the variance.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

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

full text

The Average Height of Catalan Trees by Counting Lattice Paths

Structured documents, like books, articles, and web pages, are composed of chapters, sections, paragraphs, figures, appendices, indices, etc. The occurrences of these components are mutually constrained; for instance, it is understood that a section is part of a chapter and that appendices are located at the end of a document. This hierarchical layout is meant to facilitate reading, and it supp...

full text

Concurrent Search and Insertion in K-Dimensional Height Balanced Trees

K-Dimensional Height Balanced Trees represent one solution to handle simultaneous tree operations (insertion, search) with multiple value keys in an efficient way. The current paper focuses on discussing some of the intricacies and overhead caused by the concurrency aspects, as well as providing an implementation of the algorithm, together with a discussion regarding its correctness. 1. Context...

full text

Highly Scalable Data Balanced Distributed B-trees

Scalable distributed search structures are needed to maintain large volumes of data and for parallel databases. In this paper, we analyze the performance of two large scale data-balanced distributed search structures, the dB-tree and the dE-tree. The dB-tree is a distributed B-tree that replicates its interior nodes. The dE-tree is a dB-tree in which leaf nodes represent key ranges, and thus re...

full text

Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model

Casas. R., J. Diaz and C. Martinez, Average-case analysis on simple families of trees using a balanced probability model, Theoretical Computer Science 117 (1993) 99-112. We extend the binary search tree model of probability to simply generated families of trees. In the resulting statistics, well-balanced trees are more likely than linear trees. Using this balanced model, analyses are more compl...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue None

pages  175- 218

publication date 2004-11

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023