Splaying a search tree in preorder takes linear time.

Ranjan Chaudhuri Hartmut Höft

Published in: SIGACT News (1993)

Keyphrases

search tree
search algorithm
search space
branch and bound algorithm
depth first search
b tree
tree search
root node
sat solvers
branching factor
worst case
iterative deepening
binary search trees
backtracking algorithm
neural network
game tree
mobile robot
similarity measure