General References on BST Traversal¶
Non Stack-Based BST Iterators Implementation Discussions¶
Stack-Based Iterators Implementations Discussion¶
Non-Stack-based Iterators and Iterative Algorithms¶
If the node class has a parent pointer, tree traversal can be done iteratively without recourse to a stack. Such iterators classes for in-order, pre-order and post-order recursion algorithms are discussed below.