Assertion: tree's root | /r/HasAspect | many children
Facets:
value: infinitely
type: DEGREE
Source sentences:
text: On the other hand, given a tree of depth 2, where the root has infinitely many children, and each of these children has two children, a depth-first search will visit all nodes, as once it exhausts the grandchildren (children of children of one node), it will move on to the next (assuming it is not post-order, in which case it never reaches the root).
text: Each node has at least a children and at most b children, while the root has at least 2 children and at most b children.
text: The root has at least two children if it is not a leaf node.