Category:Labeled Trees

This category contains results about Labeled Trees.
Definitions specific to this category can be found in Definitions/Labeled Trees.

A labeled tree is a finite tree (which may or may not be rooted) in which each node has attached to it a label.

These labels may be any symbol or other object that one can think of, but usually consist of one letter or symbol.

This article is complete as far as it goes, but it could do with expansion. In particular: A picture like this, exemplifying the below You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

The parent function is usually depicted by placing the ancestor above the child and connecting them with a line.

The various children of a node may also be considered to be in a particular order.

This is usually depicted by placing them in a left-to-right order.