Contoh Program Queue Dengan Linked List
Circular Double Linked List Merupakan double linked list yang simpul terakhirnya menunjuk ke simpul terakhirnya menunjuk ke simpul awalnya menunjuk ke simpul akhir sehingga membentuk suatu lingkaran. Contoh program Stack dan Queue linklist single linklist dengan menggunakan class node(). This is a list of notable port numbers used by protocols of the transport layer of the Internet protocol suite for the. Contoh Program Queue Dengan Linked List.
Embed
| /*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(); |
| } |
commented May 25, 2015
Thnx |
commented Oct 30, 2015
There is a mistake in dequeue method ..you need to do temp = temp->next; |
commented Apr 4, 2016
Shouldn't you return something with the Dequeue function? |
commented Jul 23, 2016
Why have you used the Front function? It's never really called. Please explain the purpose of this function definition. |
commented Jul 23, 2016
@MRSharff - The purpose of dequeue function is to delete a node from the linked list. It has nothing to do with returning something. |
commented Nov 6, 2016
Thanks a lot for this sample code. |
commented Nov 15, 2016 • edited
edited
Hey, There is a typo in Front function, when frontNULL - > return -1 or something instead of nothing. |
commented Mar 14, 2017
Your code is very helpful here is another example hope it adds to your concept. |
commented Apr 28, 2017
There is a simpler one here |
commented Nov 27, 2017 • edited
edited
Contoh Program Queue Menggunakan Linked List
commented Dec 20, 2017
what we must do if the Data in our struct was int and string (number and name of student) |
commented Dec 25, 2017
can anyone tell me what is the use of the function int Front in this code?I am confused. |
commented Jan 29, 2018
@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. |
commented Mar 21, 2018
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. |
commented Aug 10, 2018
Thank you so much |
commented Aug 26, 2018
sir make videos on other topics also,i observed that u r not uploading videos from past 2-3 years ,why sir? |
Contoh Program Double Linked List
commented Oct 13, 2018
THANKS ....IT'S SIMPLE AND COOL .... |
commented Jan 3, 2019
Its to get the first element of the Queue(He didn't call it though) |
commented Feb 11, 2019
If anyone tried with local front and rear variables in main method ! |
commented Feb 11, 2019
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 |