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

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Casas, R., Díaz, J., & Martínez, C. (1993). Average-case analysis on simple families of trees using a balanced probability model. Theoretical Computer Science, 117(1–2), 99–112. https://doi.org/10.1016/0304-3975(93)90306-E

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free