Hi CS 3100 Class --

I think this code is almost ready to use if you want to implement
your list of shady characters with the BST code from the book and
your lists of attributes with the ListP code of the book. 

The code here is like what I gave you before except 

1) I added a "copyListNodes" function, a "removeAll" function,
and an overloaded '=' operator to the code for the list class,

2) I modified "KeyedItem.h" and "TreeNode.h" so that the BST will
accept "KeyedItems" that contain a name for a shady character, a
list of attribute strings, and a "isSuspect" flag, 

3) I gave class KeyItem an overloaded '=' operator.

4) I added a Makefile, another driver, and a little list of
design ideas, and

5) I modified the header files so they wont' cause redundant
declarations.


The style of this code is not perfect and I don't guarantee that
it is complete or bug-free.

If you want to use this code to get started with your program, go
ahead.  I intend to use it when I make my "solution" program.

Remember that you are still responsible to turn in a program that
works and has good style.

If parts of this code don't work or have bad style, and you
incorporate it into your program and turn it in to me for a
grade, then it's legitimate for me to take points off.

Regards.

-- john sarraille