A Simple Balanced Search Tree with O(1) Worst-Case Update Time.

Rudolf Fleischer

Published in: Int. J. Found. Comput. Sci. (1996)

Keyphrases

search tree
worst case
search space
search algorithm
branch and bound algorithm
upper bound
b tree
root node
iterative deepening
depth first search
dynamic environments
particle swarm optimization
multi dimensional
np hard
lower bound
binary search trees
decision trees