antics nodes form a tree, with the root of the tree always having
an id of zero. The <code>childrenInTraversalOrder</code> and <code>childrenInHitTestOrder</code>
are the ids of the nodes that are immediate children of this node. The
former enumerates children in traversal order, and the latter enumerates
the same children in the hit test order. The two lists must have the same
length and contain the same ids. They may only differ in the order the
ids are listed in. For more information about different chil