Keywords

#tree_traversal

Tree traversal

Class of algorithms

In computer science, tree traversal is a form of graph traversal and refers to the process of visiting 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.

Thu 27th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Tree traversal Nested set model Tree (data structure) Graph traversal Threaded binary tree Corecursion Depth-first search Red–black tree Traversal Binary tree
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.