CSCE 3110  Homework #4


        Due date:  Monday, 03/02/2009


        Exercise 3.11 in Chapter 3 of the text, pages 108,109:

        By analogy with the textbook implementation of list (Figures
        3.11 - 3.20), implement a singly linked list with a header
        node but no tail node as a class template named singleList.
        Include methods to
        a.  return the size of the linked list,
        b.  print the linked list,
        c.  test if a value x is contained in the linked list,
        d.  add a value x if it is not already contained in the list,
        e.  remove a value x if it is contained in the linked list.

        Include a main function that instantiates a list of integers,
        singleList<int>, and allows an interactive user to execute any 
        of the five member functions listed above.

        Your program should be implemented in a single file named
        hw4.cpp and emailed to the grader, Payal Khimani:
        psk0025@unt.edu.

        Also, submit a source code listing in class on the due date.
        Your code should include comments, and your name should appear
        at the top of the file.