Tree search algorithm

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

Algorithms

Search

• A*
• Best-first search
• Bidirectional search
• Breadth-first search
• Depth-first search
• Depth-limited search
• Floyd-Warshall algorithm
• Iterative deepening depth-first search
• Uniform-cost search

Traversal

• Inorder traversal
• Postorder traversal
• Preorder traversal

Related articles

• Data structure
• Binary search tree
• Self-balancing binary search tree

External link

• Gamasutra article reviewing many search algorithms: http://www.gamasutra.com/features/19970801/pathfinding.htm
• Remko Tronçon and Joost Vennekens's JSearch demo applet: demonstrates various search algorithms.