Tree traversal
Class of algorithms / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Tree traversal?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
"Tree search" redirects here. Not to be confused with Search tree.
In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure, exactly once. 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.
This article needs additional citations for verification. (May 2009) |