Rooted tree
A rooted tree is a tree
with a root vertex . This is sometimes represented as . In a rooted tree
is not considered a leaf vertex, - we can assign all vertices
a distance from the root by the path distance or the (unique) path length between and . This is sometimes called its level , - the vertices
into parents and leaf vertices respectively, and - we let
be the set of children of .