Tree

From InfoAnarchy
Jump to: navigation, search

See also: Data structure | Programming

In programming, a data structure with a single starting node, called the root, and zero or more subtrees each of whose roots are connected to the initial root by a branch.

In this scenario, the initial root node is the parent and each of the subtree root nodes are children. Nodes with no children are called leaf nodes. Data may be stored at every node, or only at leaves.

Tree Types