On the concentration of the height of binary search trees
The expectation of the absolute value of the difference between the heights of two random binary search trees of n nodes is less than 6.25 for infinitely many n. Given a plausible assumption, this expectation is less than 4.96 for all but a finite number of values of n.
Unable to display preview. Download preview PDF.
- 4.J. M. ROBSON. The height of binary search trees. Australian Computer Journal, 11:151–153, 1979.Google Scholar