Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first traversal.
Returns an unmodifiable iterable over the nodes in a tree structure, using breadth-first traversal. That is, all the nodes of depth 0 are returned, then depth 1, then 2, and so on.
No guarantees are made about the behavior of the traversal when nodes change while
iteration is in progress or when the iterators generated by #children
are advanced.
Returns an unmodifiable iterable over the nodes in a tree structure, using post-order traversal.
Returns an unmodifiable iterable over the nodes in a tree structure, using post-order traversal. That is, each node's subtrees are traversed before the node itself is returned.
No guarantees are made about the behavior of the traversal when nodes change while
iteration is in progress or when the iterators generated by #children
are advanced.
Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal.
Returns an unmodifiable iterable over the nodes in a tree structure, using pre-order traversal. That is, each node's subtrees are traversed after the node itself is returned.
No guarantees are made about the behavior of the traversal when nodes change while
iteration is in progress or when the iterators generated by #children
are advanced.
Views elements of a type
T
as nodes in a tree, and provides methods to traverse the trees induced by this traverser.For example, the tree
can be iterated over in preorder (hdabcegf), postorder (abcdefgh), or breadth-first order (hdegabcf).
Null nodes are strictly forbidden.
0.11 (copied from guava-libraries)