Login / Signup
Constant bounds on the moments of the height of binary search trees.
J. M. Robson
Published in:
Theor. Comput. Sci. (2002)
Keyphrases
</>
binary search trees
data structure
parallel algorithm
search tree
lower bound
upper bound
upper and lower bounds
kd trees
worst case
b tree
lower and upper bounds
error bounds
constant factor
data mining
genetic algorithm
zernike moments
data model