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.
Read more about Tree Traversal: Traversals, Example, Infinite Trees
Famous quotes containing the word tree:
“A single fiber does not make a thread, nor a single tree a forest.”
—Chinese proverb.