An iterator of the IDs of the children of a given node, in insertion order.
An iterator of the IDs of a given node and its descendants, as a pre-order depth-first search where children are visited in insertion order.
A tree structure implemented using a single Vec and numerical identifiers (indices
in the vector) instead of reference counted pointers like.
The tree’s node type.
An iterator of the “sides” of a node visited during a depth-first pre-order traversal,
where node sides are visited start to end and children are visited in insertion order.