Circular Linked Lists

Instructions

This chapter defined and identified various operations on a circular linked list.

1. Write the definitions of the class circularLinkedListand its member functions. (You may assume that the elements of the circular linked list are in ascending order.)

2. Write a program to test various operations of the class defined in the step above.

Main.cpp is provided:

#include

#include "circularLinkedList.h"

using namespace std;

void testCopyConstructor(circularLinkedList oList);

int main()

{

circularLinkedList list1, list2;

int num;

cout << "Enter number ending with -999" << endl;

cin >> num;

while (num != -999)

{

list1.insertNode(num);

cin >> num;

}

cout << endl;

cout << "List 1: ";

list1.print();

cout << endl;

cout << "Length List 1: " << list1.length() << endl;

cout << "Enter the number to be searched: ";

cin >> num;

cout << endl;

if (list1.search(num))

cout << num << " found in the list" << endl;

else

cout << num << " not in the list" << endl;

cout << "Enter the number to be deleted: ";

cin >> num;

cout << endl;

list1.deleteNode(num);

cout << "After deleting the node, "

<< "List 1: ";

list1.print();

cout << endl;

cout << "Length List 1: " << list1.length() << endl;

list2 = list1;

cout << "List 2: ";

list2.print();

cout << endl;

cout << "Length List 2: " << list2.length() << endl;

testCopyConstructor(list1);

cout << "List 1: ";

list1.print();

cout << endl;

return 0;

}

void testCopyConstructor(circularLinkedList oList)

{

}