Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10333904 | Theoretical Computer Science | 2011 | 19 Pages |
Abstract
Moreover, we can apply our general results to obtain exact and asymptotic results for several parameters in binary search trees, namely the expected number of common ancestors of the nodes with rank i and j, the expected size of the subtree rooted at the least common ancestor of the nodes with rank i and j, and the expected distance between the nodes of ranks i and j.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Conrado MartÃnez, Alois Panholzer, Helmut Prodinger,