rooted tree

rooted tree

[′rüd·əd ′trē] (mathematics) A directed tree graph in which one vertex has no predecessor, and each of the remaining vertices has a unique predecessor.