Poisson approximations for functionals of random trees
We use Poisson approximation techniques for sums of indicator random variables to derive explicit error bounds and central limit theorems for several functionals of random trees. In particular, we consider (i) the number of comparisons for successful and unsuccessful search in a binary search tree and (ii) internode distances in increasing trees. The Poisson approximation setting is shown to be a natural and fairly simple framework for deriving asymptotic results. (C) 1996 John Wiley & Sons, Inc.
poisson approximation binary search trees increasing trees recursive trees