CS301- Data Structures Assignment No.1 Solution Spring 2014

[Vuhelper]

I am sending you a C++ program related to linked list along with your assignment file. In the given C++ program, I did not write some functions. Name of these functions are given below.

1) main()
2) List addNodes(int number)
3) void split(int c, List list, List largeList, List smallList)
4) void differenceList(List listA, List listB)
Linked List:
#include <iostream.h>
#include <stdlib.h>

class Node
{
public:
int get() { return object; };
void set(int object) { this->object = object; };
Node * getNext() { return nextNode; };
void setNext(Node * nextNode) { this->nextNode = nextNode; };
private:
int object;
Node * nextNode;
};


class List
{
public:
List();
void add (int addObject);
int get();
bool next();
friend void traverse(List list);
friend List addNodes(int number);
friend void split(int c, List list, List largeList, List smallList);
friend void differenceList(List listA, List listB);



private:
int size;
Node * headNode;
Node * currentNode;
Node * lastCurrentNode;
};
/* Constructor */
List::List()
{
headNode = new Node();
headNode->setNext(NULL);
currentNode = NULL;
lastCurrentNode = NULL;
size = 0;
}
/* add() class method */
void List::add (int addObject)
{
Node * newNode = new Node();
newNode->set(addObject);
if( currentNode != NULL )
{
newNode->setNext(currentNode->getNext());
currentNode->setNext( newNode );
lastCurrentNode = currentNode;
currentNode = newNode;
}
else
{
newNode->setNext(NULL);
headNode->setNext(newNode);
lastCurrentNode = headNode;
currentNode = newNode;
}
size ++;
}
/* get() class method */
int List::get()
{
if (currentNode != NULL)
return currentNode->get();
}
/* next() class method */
bool List::next()
{
if (currentNode == NULL) return false;
lastCurrentNode = currentNode;
currentNode = currentNode->getNext();
if (currentNode == NULL || size == 0)
return false;
else
return true;
}
/* Friend function to traverse linked list */
void traverse(List list)
{
Node* savedCurrentNode = list.currentNode;
list.currentNode = list.headNode;
cout "\n\n Elements of list are given below ";
for(int i = 1; list.next(); i++)
{
cout "\n Element " i " " list.get();
}
cout "\n List size = " list.size '\n';
list.currentNode = savedCurrentNode;
}

void split(int c, List list, List largeList, List smallList)
{

}



List addNodes(int number)
{

}

void differenceList(List listA, List listB){

}



main()
{


}