Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.aml.2012.06.005 | Applied Mathematics Letters |
Keywords | Field | DocType |
Binary search trees,Random structure,Combinatorial probability,Asymptotic analysis | Geometry of binary search trees,Discrete mathematics,Mathematical optimization,Combinatorics,Treap,Binary tree,Optimal binary search tree,Weight-balanced tree,Random binary tree,Ternary search tree,Binary search tree,Mathematics | Journal |
Volume | Issue | ISSN |
25 | 12 | 0893-9659 |
Citations | PageRank | References |
5 | 0.73 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hosam M. Mahmoud | 1 | 183 | 55.63 |
| Mark Daniel Ward | 2 | 19 | 6.99 |