Tree traversal

topic information


general information about Tree traversal

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.
Aliases: 0082-6bfc
F W

related topics


topics related to Tree traversal

message stream


messages about Tree traversal

Walks

Todays featured event: Can you tell red campion from ragged robin? Join NTS for a wildflowers workshop May 13th:
7 ½ days ago from Twitter

Day 72: Tree Walk on Flickr - Photo Sharing!

Day 72: Tree Walk Thank you for the lovely time, Ruth et al.
7 ½ days ago from Flickr

Auto Content Cash

Tree Search Engine Renegades Reveal the Auto Content System Google Actualy Loves!|
7 days ago from Twitter

Dijkstra's algorithm

Dijkstra's algorithm
5 ½ days ago from feedly

message history


messages per hour for Tree traversal

top articles


articles discussing Tree traversal


attribution for Tree traversal

Freebase CC-BY Freebase content licensed under CC-BY
Wikipedia content licensed under GFDL