CS301 Data Structures Assignment No. 1 Solution and Discussion Fall 2014

[viki]

#include

using namespace std;
class Node{

public:

void set(int object1){
object = object1;

}
int get(){return object;}
Node *getNext(){return nextNode;}
void setNext(Node *next){this->nextNode = next;}

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();

private:
int size;
Node * headNode;
Node *currentNode;
Node * lastCurrentNode;

};
List::List(){// list constructor
headNode= new Node();
headNode-> setNext(NULL);
currentNode = NULL;
lastCurrentNode=NULL;
size=0;
}
void List::add(int addobject){ //method for add new object
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++;
}
int List::get(){
if(currentNode!=NULL){
return currentNode->get();
}
}
bool List:: next(){
if(currentNode == NULL) return false;
lastCurrentNode = currentNode;
currentNode = currentNode->getNext();
if(currentNode==NULL || size==0) return false;
else return true;

}
void traverse(List list){
Node *savedCurrentNode = list.currentNode;
list.currentNode= list.headNode;
for(int i=1; list.next(); i++){
cout"\n Element "i" "list.get();

}
list.currentNode= savedCurrentNode;
}
List addNodes(){
List list;

list.add(1);
list.add(2);
list.add(3);
list.add(4);
list.add(5);
list.add(6);
cout"\n list size "list.size;
return list;
}
// main method
main(){
List list = addNodes();

traverse(list);

coutendl;
system("pause");
}