rooted ordered tree

rooted ordered tree

[′rüd·əd ′ȯr·dərd ′trē] (mathematics) A rooted tree in which the order of the subtrees formed by deleting the root vertex is significant.