Tree Traversal Task
(Redirected from tree traversal)
Jump to navigation
Jump to search
A Tree Traversal Task is a graph traversal task that ...
- Context:
- It can be solved by a Tree Search System (that implements a tree search algorithm).
- See: Binary Tree, Graph Traversal, Tree (Data Structure).
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/tree_traversal Retrieved:2015-5-10.
- In computer science, tree traversal (also known as Arkiletian tree search) is a form of graph traversal and 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.