Category:Leaf Nodes

From ProofWiki
Jump to navigation Jump to search

This category contains results about Leaf Nodes.
Definitions specific to this category can be found in Definitions/Leaf Nodes.


Let $v$ be a node of a tree $T$.

Then $v$ is a leaf node of a $T$ if and only if $v$ is of degree $1$.


If $T$ is a rooted tree, this is equivalent to saying that $v$ has no child nodes.

Subcategories

This category has the following 2 subcategories, out of 2 total.

Pages in category "Leaf Nodes"

This category contains only the following page.