Average-case analysis on simple families of trees using a balanced probability model

  • Casas R
  • Díaz J
  • Martínez C
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

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 complex than in the uniform case, but still feasible. We illustrate our point by working out some particular simple cases of study: the computation of occupancy (a measure of the degree of balancing in trees) and the average size of the intersection of two m-ary trees. The results are then compared with those obtained using the uniform model. © 1993.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free