OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update in Deque() fuction

Browse Source 
Because of earlier logic not going to deque the last element of the queue because at the last front == rear as per your logic which directly results in "Underflow".
This commit is contained in:
Omkar Kolate 2019-08-15 16:10:59 +05:30 committed by GitHub
parent 71b03523dd
commit 3631f6570e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Data Structure/Queue Using Linked List.cpp
View File

@ -35,7 +35,7 @@ void Enque(int x)
void Deque() void Deque()
{ {
if (rear==front) if (rear == NULL && front == NULL)
{ {
cout<<"\nUnderflow"; cout<<"\nUnderflow";
} }
@ -45,6 +45,8 @@ void Deque()
cout<<"\n"<<t->val<<" deleted"; cout<<"\n"<<t->val<<" deleted";
front=front->next; front=front->next;
delete t; delete t;
if(front == NULL)
rear = NULL;
} }
} }