TREETRAVERSAL
Tree traversal
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.The above text is a snippet from Wikipedia: Tree traversal
and as such is available under the Creative Commons Attribution/Share-Alike License.