The cost of offline binary search tree algorithms and the complexity of the request sequence.

Jussi Kujala Tapio Elomaa

Published in: Theor. Comput. Sci. (2008)

Keyphrases

computational complexity
binary search trees
worst case
computational cost
significant improvement
theoretical analysis
learning algorithm
orders of magnitude
complexity measures
data structure
optimization problems
high computational complexity
real time
training data
special case
search tree