= Search tree
{wiki=Search_tree}
A **search tree** is a data structure that is used to represent different possible states or configurations of a problem, allowing for efficient searching and decision-making. It is particularly useful in algorithm design, artificial intelligence, and combinatorial problems. The structure can help in exploring paths or options systematically to find a solution or optimize a given objective. \#\#\# Characteristics of Search Trees: 1. **Nodes**: Each node in a search tree represents a potential state or configuration in the problem.
Back to article page