//My example
#include <iostream>
using namespace std;
class IntNode {
public:
IntNode(){}
IntNode(int theData, IntNode* theLink) : data(theData),link(theLink) {}
IntNode* getLink() const {return link; }
int getData() const {return data; }
void setData(int theData) {data = theData; }
void setLink(IntNode* pointer) {link = pointer; }
private:
int data;
IntNode *link;
};
typedef IntNode* IntNodePtr;
class LinkedList1 {
public:
LinkedList1() {head = NULL;}
//void headInsert(IntNodePtr& head, int theData);
void headInsert(int theData);
void insert(IntNodePtr afterMe, int theData);
void deleteHeadNode();
void remove(int theData);
void output();
private:
IntNodePtr head;
};
int main() {
char ans;
int tableSize=0;
cout<<"Please enter in the table size: ";
cin >> tableSize;
[B] LinkedList1* first;
first = new LinkedList1[tableSize];[/B]
do {
first[0].headInsert(2);
first[0].headInsert(3);
first[0].headInsert(4);
first[0].headInsert(5);
first[0].headInsert(6);
first[0].output();
first[0].deleteHeadNode();
cout<<endl;
first[0].output();
first[0].remove(3);
cout<<endl;
first[0].output();
cout << "Would you like to start over again(y = yes/n = no)? ";
cin >> ans;
} while (ans != 'n');
return 0;
}//end of main
void LinkedList1::headInsert(int theData) {
head = new IntNode(theData, head);
}//end of headInsert
void LinkedList1::insert(IntNodePtr afterMe, int theData) {
afterMe->setLink(new IntNode(theData, afterMe->getLink()));
}//end of insert
void LinkedList1::deleteHeadNode() {
if (head != NULL) {
head = head->getLink();
}//end of if statement
else {
cout<<"You are at the first node already"<<endl;
}//end of else
}//end of deleteHeadNode
void LinkedList1::remove(int theData) {
IntNodePtr before,discard,test;
before = head;
discard = head;
test = head;
int count1 = 0;
int count2 = 0;
int count3 = 0;
if (before == NULL) {
cout<<"List is empty"<<endl;
}
else {
while(discard->getData() != theData && discard->getLink() != NULL) {
count1++;
discard = discard->getLink();
}//end of while loop
int i = count1 - 1;
while (count2 != i) {
before = before->getLink();
count2++;
}//end of while loop
while(test->getLink() != NULL) {
test = test->getLink();
count3++;
}
if(count3 == count1) {
cout<<"Value is not in the list"<<endl;
}
}
before->setLink(discard->getLink());
}//end of remove function
void LinkedList1::output() {
IntNodePtr position = head;
if(position == NULL) {
cout<<"The list is empty"<<endl;
}
else {
while(position != NULL) {
cout<<"The values of the list are "<<position->getData()<<endl;
position = position->getLink();
}//end of while loop
}
}//end of output list
