Tuesday

1.	Copy files chain.h, cnode.h, xcept.h into your lab4 dir
2.	Copy last week's lab (program) into your lab4 dir
3.	Change "llist.h" to "chain.h", change all occurrences of
	LinearList to Chain. The declaration of L shouldn't have (15)
4.	Compile, link and run last week's lab with the chain implementation
	of the list.

	We managed to use the same driver with different implementation.
5.	Create files dnode.h and double.h
6.	Type in the template class definition of DoubleNode in dnode.h
	Type in the template class definition of Double in double.h
	See program 3.21 on page 141. You have to add the function IsEmpty().
7.	Write stubs for the member functions using only return statements
	For Example:

	template<class T>
	int Double<T>::Length() const
	{
		return 0;
	}
	template<class T>
	Double<T>& Double<T>::Delete(int k, T& x)
	{
		return *this;
	}

	Also add the template for the output operator <<.
8.	Change Chain to Double in our test program.
9.	Compile and link 

Thursday

1.	Write the appropriate code for
	Double<T>::Length()
	Double<T>::Insert(int k, const T& x)
	Double<T>::Find(int k, T& x)
2.	Compile, link, run the driver program

Once you put the code for remaining member functions, you are set
for Assignment #3.
Algorithms for the member functions will be provided in the class.

The merge function is similar to the InsertInOrder.
Algorithm for the merge function will be discussed in the class.