Tree traversal - Wikipedia, the free encyclopedia

Tree traversal - Wikipedia, the free encyclopedia

Tree traversal

From Wikipedia, the free encyclopedia

Jump to: navigation, search

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (May 2009)

Graph and tree
search algorithms

• α — β
• A*
• B*
• Beam
• Bellman–Ford
• Best-first
• Bidirectional
• Borůvka
• Branch & bound
• BFS
• British Museum
• D*
• DFS
• Depth-limited
• Dijkstra
• Edmonds
• Floyd-Warshall
• Hill climbing
• Iterative deepening
• Kruskal
• Johnson
• Lexicographic BFS
• Prim
• Uniform-cost

Listings

• Graph algorithms
• Search algorithms
• List of graph algorithms

Related topics

• Dynamic programming
• Graph traversal
• Tree traversal
• Search games

• v
• t
• e

In computer science, tree traversal refers to the process of visiting (examining and/or updating) 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.