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:
“Arise, my love, my fair one, and come away; for now the winter is past, the rain is over and gone. The flowers appear on the earth; the time of singing has come, and the voice of the turtledove is heard in our land. The fig tree puts forth its figs, and the vines are in blossom; they give forth fragrance. Arise, my love, my fair one, and come away.”
—Bible: Hebrew, Song of Solomon 2:10-13.