Tree search algorithm

Tree search algorithms are specialized versions of graph search algorithms, which take the properties of trees into account.

• Depth-first search
• Breadth-first search
• Best-first search

A transcendental tree search algorithm called A* guarantees the shortest path from any beginning point to any end point. Despite this assurance, A* (pronounced "Ay-star") can be computationally expensive and is therefore not always used.