Update Queue Using Linked List.cpp

This commit is contained in:
Yang Libin 2019-08-21 09:17:20 +08:00 committed by GitHub
parent 0ab4f5f89d
commit abc0d365de
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -1,4 +1,4 @@
#include<iostream>
#include <iostream>
using namespace std;
struct node
@ -7,29 +7,27 @@ struct node
node *next;
};
node *front, *rear;
void Enque(int x)
{
if (rear==NULL)
if (rear == NULL)
{
node *n= new node;
n->val=x;
n->next=NULL;
rear=n;
front=n;
node *n = new node;
n->val = x;
n->next = NULL;
rear = n;
front = n;
}
else
{
node *n = new node;
n->val=x;
n->next=NULL;
rear->next=n;
rear=n;
n->val = x;
n->next = NULL;
rear->next = n;
rear = n;
}
}
@ -37,26 +35,27 @@ void Deque()
{
if (rear == NULL && front == NULL)
{
cout<<"\nUnderflow";
cout << "\nUnderflow";
}
else
{
node *t = front;
cout<<"\n"<<t->val<<" deleted";
front=front->next;
cout << "\n"
<< t->val << " deleted";
front = front->next;
delete t;
if(front == NULL)
if (front == NULL)
rear = NULL;
}
}
void show()
{
node *t=front;
while(t!=NULL)
node *t = front;
while (t != NULL)
{
cout<<t->val<<"\t";
t=t->next;
cout << t->val << "\t";
t = t->next;
}
}
@ -65,28 +64,26 @@ int main()
int ch, x;
do
{
cout<<"\n1. Enque";
cout<<"\n2. Deque";
cout<<"\n3. Print";
cout<<"\nEnter Your Choice : ";
cin>>ch;
if (ch==1)
cout << "\n1. Enque";
cout << "\n2. Deque";
cout << "\n3. Print";
cout << "\nEnter Your Choice : ";
cin >> ch;
if (ch == 1)
{
cout<<"\nInsert : ";
cin>>x;
cout << "\nInsert : ";
cin >> x;
Enque(x);
}
else if (ch==2)
else if (ch == 2)
{
Deque();
}
else if (ch==3)
else if (ch == 3)
{
show();
}
}
while(ch!=0);
} while (ch != 0);
return 0;
}