Module traversal

Tree traversal iterators over node indices, node values or both at the same time. In order for a tree data structure to support these iterators, the Traversable trait must be implemented.

Provided traversals are:

• Binary In-Order
• Binary Pre-Order
• Binary Post-Order
• Depth-First Search
• Breadth-First Search

Structs

BinaryInOrder

Iterator over node contents and the corresponding node indices in binary in-order

BinaryInOrderIndices

Iterator over node indices in binary in-order

BinaryInOrderValues

Iterator over node contents in binary in-order

BinaryPostOrder

Iterator over node contents and the corresponding node indices in binary post-order

BinaryPostOrderIndices

Iterator over node indices in binary post-order

BinaryPostOrderValues

Iterator over node contents in binary post-order

BinaryPreOrder

Iterator over node contents and the corresponding node indices in binary pre-order

BinaryPreOrderIndices

Iterator over node indices in binary pre-order

BinaryPreOrderValues

Iterator over node contents in binary pre-order

GeneralBfs

Iterator over node contents and the corresponding node indices in breadth-first search order

GeneralBfsIndices

Iterator over node indices in breadth-first search order

GeneralBfsValues

Iterator over node contents in breadth-first search order

GeneralDfs

Iterator over node contents and the corresponding node indices in depth-first search order

GeneralDfsIndices

Iterator over node indices in depth-first search order

GeneralDfsValues

Iterator over node contents in depth-first search order

Traits

Traversable

This trait defines the interface for using the traversal iterators provided by this module.