This semester I am a TA for CSE 250 - Algorithms and Data Structures.
My office hours are Tuesday 11:00-12:30, and Thursday 9:00-10:30 in Trailer E24 (Or just generally near the couch :) ).


3/4/2008
Thanks to the debugging efforts of Xuming, I now have a working example for the Binary Search Tree
and AVL Tree code as from the book. The code is all here:
BinarySearchTree.h
BinarySearchTree.cpp
AvlTree.h
AvlTree.cpp
dsexceptions.h
treeTest.cpp
Node.cpp
Node.h

In order to compile use the command:

g++ -R/util/gnu/lib treeTest.cpp Node.cpp -o tree

Note the absence of the tree .cpp files in this statement!
Also, you may not need the -R option.

2/26/2008
Here is the example I promised of using the system clock to time something in your code:
timeTest.cc

And here are the links to the source code you will need from the weiss book:
AVLTree.h
AVLTree.cpp
BinarySearchTree.h
BinarySearchTree.cpp


2/15/2008
Here is the main test program I used for grading HW1.
Note that for case 1, the main thing I was looking for was if it crashed or gave a runtime error.


2/14/2008
The following are the files that I went over in recitation which provide an example of using the stl sort()
function to sort Nodes by number and name. I hope you find it helpful.
Node.cc
Node2.h
sortTest.cc
Another makefile for this example


2/7/2008
Parsing Example as shown in recitation. Use it as a guideline for your main programs.
Makefile also as shown in recitation. I included comments for syntax.