/*Queue - Linked List implementation*/ |
#include<stdio.h> |
#include<stdlib.h> |
struct Node { |
int data; |
struct Node* next; |
}; |
// Two glboal variables to store address of front and rear nodes. |
struct Node* front = NULL; |
struct Node* rear = NULL; |
// To Enqueue an integer |
voidEnqueue(int x) { |
struct Node* temp = |
(struct Node*)malloc(sizeof(struct Node)); |
temp->data =x; |
temp->next = NULL; |
if(front NULL && rear NULL){ |
front = rear = temp; |
return; |
} |
rear->next = temp; |
rear = temp; |
} |
// To Dequeue an integer. |
voidDequeue() { |
struct Node* temp = front; |
if(front NULL) { |
printf('Queue is Emptyn'); |
return; |
} |
if(front rear) { |
front = rear = NULL; |
} |
else { |
front = front->next; |
} |
free(temp); |
} |
intFront() { |
if(front NULL) { |
printf('Queue is emptyn'); |
return; |
} |
return front->data; |
} |
voidPrint() { |
struct Node* temp = front; |
while(temp != NULL) { |
printf('%d',temp->data); |
temp = temp->next; |
} |
printf('n'); |
} |
intmain(){ |
/* Drive code to test the implementation. */ |
// Printing elements in Queue after each Enqueue or Dequeue |
Enqueue(2); Print(); |
Enqueue(4); Print(); |
Enqueue(6); Print(); |
Dequeue(); Print(); |
Enqueue(8); Print(); |
} |
Disk utility alternative for mac. Thnx |
There is a mistake in dequeue method .you need to do temp = temp->next; then free(first); first = temp; You are freeing the second element each time and if free->next is null then it will crash. |
Shouldn't you return something with the Dequeue function? Lemmings mac download. |
Why have you used the Front function? It's never really called. Please explain the purpose of this function definition. |
@MRSharff - The purpose of dequeue function is to delete a node from the linked list. It has nothing to do with returning something. |
Thanks a lot for this sample code. |
Hey, There is a typo in Front function, when frontNULL - > return -1 or something instead of nothing. |
Your code is very helpful here is another example hope it adds to your concept. C++ queue implementation using linked list |
There is a simpler one here |
what we must do if the Data in our struct was int and string (number and name of student) |
can anyone tell me what is the use of the function int Front in this code?I am confused. Thanks in advance! |
@labeelola This is when you want to view, the latest value in front of the queue. This is not called, but that's not a problem, you can call it anywhere. It is just to view. |
Hey guys, Please help me to complete my Assignment, I dont know much about C Programming
Remark: ADT Queue is 'First in First Out'. enqueue - always add a new node at the back of the queue. dequeue - delete the head of the queue. |
Thank you so much |
Roll back graphics driver windows 10. sir make videos on other topics also,i observed that u r not uploading videos from past 2-3 years ,why sir? |
THANKS ..IT'S SIMPLE AND COOL .. |
Its to get the first element of the Queue(He didn't call it though) |
If anyone tried with local front and rear variables in main method ! |
in the Dequeue function when the second if(frontrear) runs we have to free the space of node pointed by front previously i.e first node is the one when front and rear are equal if we modify the pointer front and rear to NULL we are wasting the memory of first node that was created please reply ASAP |