Binary Tree Iterators

A binary tree iterator systematically visits each node of a binary tree.
The four standard iterators correspond to the four standard traversal methods.
Preorder Iterator
- Visit the nodes in a pre-order traversal.
- Use a stack to store unvisited nodes.
Inorder Iterator
- Visit the nodes in an in-order traversal.
- Use a stack to store unvisited nodes.
Postorder Iterator
- Visit the nodes in a post-order traversal.
- Use a stack to store unvisited nodes.
Level-order Iterator
- Visit the nodes in a level-order traversal.
- Use a queue to store unvisited nodes.
Example - PreorderIterator.cpp
Example - InorderIterator.cpp
Example - PostorderIterator.cpp
Example - LevelorderIterator.cpp

This page was last modified on Apr 10, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/BinaryTreeIterators.html