| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1708603 | Applied Mathematics Letters | 2012 | 5 Pages |
Abstract
We derive exact moments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter converges to a Gaussian limit.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Hosam M. Mahmoud, Mark Daniel Ward,