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. 

1) The list class is augmented with a "copyListNodes" function, a "removeAll"
function, and an overloaded '=' operator.

2) "KeyedItem.h" and "TreeNode.h" are set up so that a BST will store
KeyedItems.  A KeyedItem contains a name for a shady character, a list of
attribute strings, and an "isSuspect" flag,

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

4) There is sample Makefile here, some drivers you can use to run a few tests,
and a little list of design ideas.

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 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