C++链栈 及 链队列

//链栈

#include <iostream>

using namespace std;


class Node
{
Node *next;
int data;
friend class LinkQueue;
public:
Node(){ data = 0; next = NULL; }
Node(int a){ next = NULL; data = a; }
};


class LinkQueue
{
Node *front;
Node *rear;
int size;
public:
LinkQueue(){ front = new Node(); rear = new Node(); size = 0; front = rear; }
void creatLinkQueue(int);
void addLinkQueue(int);
void deLinkQueue(int &);
void print();
Node* findNode();
void addInEnd(int);
};
void LinkQueue::addInEnd(int a)
{
Node *pnew = new Node(a);
rear->next = pnew;
rear = pnew;
size++;
}
//找到尾节点的前一个节点
Node* LinkQueue::findNode()
{
Node *p = front;
int j = 0;
while (p)
{
if (j == size - 1)
return p;
else
{
p = p->next;
j++;
}
}
}
void LinkQueue::print()
{
Node *p = front->next;
while (p)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
void LinkQueue::deLinkQueue(int &a)
{
Node *ptemp = findNode();
a = ptemp->next->data;
ptemp->next=NULL;
size--;
}
void  LinkQueue::addLinkQueue(int a)
{
Node *pnew = new Node(a);
rear->next = pnew;
size++;
}
void LinkQueue::creatLinkQueue(int n)
{
int a;
while (n-- > 0)
{
cin >> a;
addInEnd(a);
}
}


int main()
{
int t;
cin >> t;
int n;
int data;
while (t-- > 0)
{
cin >> n;
LinkQueue k;
k.creatLinkQueue(n);
k.addLinkQueue(100000);
k.deLinkQueue(data);
cout << data << endl;
k.print();
}
system("pause");

}

//链队列

#include <iostream>
using namespace std;


class Node
{
Node *next;
int data;
friend class LinkQueue;
public:
Node(){ data = 0; next = NULL; }
Node(int a){ next = NULL; data = a; }
};


class LinkQueue
{
Node *front;
Node *rear;
int size;
public:
LinkQueue(){ front = new Node(); rear = new Node(); size =0; front = rear; }
void creatLinkQueue(int);
void addLinkQueue(int);
void deLinkQueue(int &);
void print();
void addInEnd(int);
};
void LinkQueue::addInEnd(int a)
{
Node *pnew = new Node(a);
rear->next = pnew;
rear = pnew;
size++;
}
void LinkQueue::print()
{
Node *p = front->next;
while (p)
{
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
void LinkQueue::deLinkQueue(int &a)
{
Node *ptemp = front->next;
a = ptemp->data;
front->next = ptemp->next;

        size--;
}
void  LinkQueue::addLinkQueue(int a)
{
Node *pnew = new Node(a);
rear->next = pnew;
}
void LinkQueue::creatLinkQueue(int n)
{
int a;
while (n-- > 0)
{
cin >> a;
addInEnd(a);                

}
}


int main()
{
int t;
cin >> t;
int n;
int data;
while (t-- > 0)
{
cin >> n;
LinkQueue k;
k.creatLinkQueue(n);
k.addLinkQueue(100000);
k.deLinkQueue(data);
cout << data << endl;
k.print();
}
system("pause");
}