| Wikipedia English The Free Encyclopedia | Download this dictionary |
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.
See more at Wikipedia.org...
This article uses material from Wikipedia® and is licensed under the GNU Free Documentation License
