Spaghetti stack

In a tree is a special graph of graph theory, or more precisely a Rooted tree.

Definition

In a tree is a directed graph with excellent node, known as the root, applies to the opposed to out -trees that root from each node is exactly one directed path can be achieved.

Other terms

The maximum input level of an in -tree is called its order, and all nodes with in-degree 0 are called leaves. The highlight of the in -tree is defined as the length of a longest path.

As with undirected trees is also referred to in rooted trees, all nodes that are not a leaf, as internal nodes. Sometimes you close your root it out though.

Alternative definition

In - Trees can also be defined recursively. They consist of a node w, which represents the root of the tree, which exclusively with the roots knotendisjunkter In -trees T1, T2, ..., Tn is connected in the direction of w.

• Trees and forests
• Directed graph