Assertion: tree's node | /r/HasProperty | followed by its direct child nodes
Facets:
Source sentences:
text: A level-order walk effectively performs a breadth-first search over the entirety of a tree; nodes are traversed level by level, where the root node is visited first, followed by its direct child nodes and their siblings, followed by its grandchild nodes and their siblings, etc., until all nodes in the tree have been traversed.