Homework 6: Ordered Set & Map Iterators

This assignment is a discussion, not a programming assignment.

Participate in the Homework 6 forum in Blackboard. This is a graded forum, worth 50 class points. It will be open during one week only.

This forum is for discussion of the 3-4 ways to implement Iterators for Binary Trees (which includes BSTs, AVLs, RBTs, RBLLTs, and others not mentioned, with the common trait that the trees are defined using Nodes with left & right child pointers and optionally parent pointers). The Iterator implementation categories are:

  1. Full: Using Navigators (aka "tree monkeys") and parent pointers
  2. Threaded: Using threading & left/right threading flags
  3. ADT Assisted: Using a control Stack or Queue
  4. Graphical: Using graph search algorithms DFS/BFS

The Chapter 17 lecture notes are the starting point for these discussions.

Note this is a graded forum!