Data Structures Program #12

CS 153 Data Structures I

Assignment #12

Due: 4/19/01

Purpose: to learn about using an STL container with an existing project

Task: Modify assignment #11 to include an iterator capability. You may have already done a part or all of this as an optional part of last week's assignment. An iterator capability involves having functions

void BST::Reset()
CString BST::GetNext();
bool BST::EOT(); //End of Tree

Detail:

Reset() should sweep thru the entire tree (IN order) and insert into an STL container (list type would be a good choice) each data item in the BST
GetNext() should remove/return 1 item from the container
EOT() (meaning EndOfTree) should return false until the container is empty

With this capabilty, Display() should be a 'user function' coded in the ...Dlg class and it should NOT appear as a BST::Display member function.

Testing: This will proceed exactly as with Program #11

Helps:

#include <list> or <stack> // the STL type container that you wish to use
using namespace std; // a requirement that we have not discussed much in class
list<CString> myList; // the way to declare an STL list container that holds CString(s). Recall that STL containers are templated classes