TITLE

IMPLEMENTING A LINKED LIST WITH RECURSIVE FUNCTIONS

INTRODUCTION

The linked list operations implemented in Project 3 that involved iteration (loops) can also be implemented recursively. This project modifies the previous one by carrying out those operations using recursion.

DESCRIPTION

Modify the List class in Project 3 to carry out repetitive operations recursively. These operations include:

• Dispose of the dynamic part of a List structure (the destructor).
• Re-initialize an existing List to be empty.
• Insert a value into a List, in the appropriate position. If the value is already present, the List is unchanged.
• Remove a value from a List. If the value is not present, the List is unchanged.
• Return the length of a List.
• Report whether or not a particular value is present in a List.
• Return the value of the k^th element of a List.
• Write out the values in a List, in order, to an output stream.

The remaining operations will be unchanged:

• Initialize a List to be empty (the default constructor).
• Is a List empty?

The client program should be unchanged; only the List class will be modified.