Tree search

In computer science, tree-traversal refers to the process of visiting each node in a tree data structure, exactly once, in a systematic way. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.
See more at Wikipedia.org...

In a tree structure, a search in which it is possible to decide, at each step, which part of the tree may be rejected without a further search.