出典:Wiktionary
出典:Wikipedia
出典:『Wikipedia』 (2011/07/04 17:04 UTC 版)
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.