Expand description
Module defining tree traversal iterators.
Structs§
- Bfs
- A breadth first search traverser, also known as level-order (wikipedia).
- Dfs
- A (pre-order) depth first search traverser (Wikipedia).
- Over
Data - Yields the data of the nodes; i.e.,
dataanddata_mut. - Over
Depth Data - Yields (depth, data) tuple of the nodes; where data might be
dataanddata_mut. - Over
Depth Node - Yields (depth,
Node) tuple of the nodes. - Over
Depth Sibling IdxData - Yields (depth, sibling_idx, data) tuple of the nodes; where data might be
dataanddata_mut. - Over
Depth Sibling IdxNode - Yields (depth, sibling_idx,
Node) tuple of the nodes. - Over
Node - Yields a reference to the nodes; i.e.,
Node. - Over
Sibling IdxData - Yields (sibling_idx, data) tuple of the nodes; where data might be
dataanddata_mut. - Over
Sibling IdxNode - Yields (sibling_idx,
Node) tuple of the nodes. - Post
Order - A post order traverser (Wikipedia).
- Traversal
- Type with methods allowing to create different
Traversertypes with different walk strategies, such as depth-first, breadth-first or post-order.
Traits§
- Over
- Type that defines the type of the items that iterators created by a traverser such as the
DfsorPostOrder. - OverMut
- Type that defines the type of the mutable items that iterators created by a traverser such as the
DfsorPostOrder. - Traverser
- A tree traverser that creates iterators which walk over a given node and all of its descendants; i.e., over all nodes of the subtree rooted at the given node.