Affiliation:
1. TU Wien, Wien, Austria
Abstract
It is shown that all centralized absolute moments
E
|
H
n
−
E
H
n
|
α
(α ≥ 0) of the height
H
n
of binary search trees of size
n
and of the saturation level
H
n
′ are bounded. The methods used rely on the analysis of a
retarded
differential equation of the form Φ′(
u
) = −α
−2
Φ(
u
/α)
2
with α > 1. The method can also be extended to prove the same result for the height of
m
-ary search trees. Finally the limiting behaviour of the distribution of the height of binary search trees is precisely determined.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献