Function traverse 

pub fn traverse<C: Cursor>(
    cursor: C,
    order: Order,
) -> impl FusedIterator<Item = C::Node>

Traverse an n-ary tree using cursor, returning the nodes of the tree through an iterator in an order according to order.

cursor must be at the root of the tree (i.e. cursor.goto_parent() must return false)