Data Structures Handbook

Data Structures at your fingertips

Queues Using Linked List

A queue can be implemented using a linked list. This has various advantages over an array representation because the size of the queue does not have to be decided before the queue is created.

Linked list allows memory to be allocated dynamically depending on the elements added and therefore does not waste or take more memory than required.

Creating the queue

  1. Include all the header files which are used in the program.
  2. Define a Node structure with two members data and next.
  3. Define two Node pointers front and rear and set both to NULL.

Inserting an element (EnQueue)

  1. Create a newNode with the given value and set newNode → next = NULL.
  2. Check whether the queue is empty (rear == NULL). 
  3. If it is empty then, set front = newNode and rear = newNode.
  4. If it is not empty then, set rear → next = newNode and rear = newNode.
  1. void enQueue(int value)
  2. {
  3. struct Node *newNode;
  4. newNode = (struct Node*)malloc(sizeof(struct Node));
  5. newNode -> data = value;
  6. newNode -> next = NULL;
  7. if (front == NULL)
  8. front = rear = newNode;
  9. else {
  10. rear -> next = newNode;
  11. rear = newNode;
  12. }
  13. printf("\nInsertion is Successful\n");
  14. }
void enQueue(int value)
{
  struct Node *newNode;
  newNode = (struct Node*)malloc(sizeof(struct Node));
  newNode -> data = value;
  newNode -> next = NULL;
  if (front == NULL)
    front = rear = newNode;
  else {
    rear -> next = newNode;
    rear = newNode;
  }
  printf("\nInsertion is Successful\n");
}

Deleting an element (DeQueue)

  1. Create a newNode with the given value and set newNode → next = NULL.
  2. Check whether the queue is Empty (rear == NULL). Terminate the function if it is already empty.
  3. Define a Node pointer temp and set it to front.
  4. Set front = front → next and delete temp. (free(temp))
  1. void deQueue()
  2. {
  3. if (front == NULL)
  4. printf("\nUnderflow. Queue is Empty\n");
  5. else {
  6. struct Node *temp = front;
  7. front = front -> next;
  8. printf("\nDeleted element: %d\n", temp -> data);
  9. free(temp);
  10. }
  11. }
void deQueue()
{
   if (front == NULL)
      printf("\nUnderflow. Queue is Empty\n");
   else {
      struct Node *temp = front;
      front = front -> next;
      printf("\nDeleted element: %d\n", temp -> data);
      free(temp);
   }
}

Full Code with Menu

  1. #inlcude <stfio.h><br><br>struct Node
  2. {
  3. int data;
  4. struct Node *next;
  5. }*front = NULL, *rear = NULL;
  7. void enQueue(int value)
  8. {
  9. struct Node *newNode;
  10. newNode = (struct Node*)malloc(sizeof(struct Node));
  11. newNode -> data = value;
  12. newNode -> next = NULL;
  13. if (front == NULL)
  14. front = rear = newNode;
  15. else {
  16. rear -> next = newNode;
  17. rear = newNode;
  18. }
  19. printf("\nInsertion is Successful\n");
  20. }
  22. void deQueue()
  23. {
  24. if (front == NULL)
  25. printf("\nUnderflow. Queue is Empty\n");
  26. else
  27. {
  28. struct Node *temp = front;
  29. front = front -> next;
  30. printf("\nDeleted element: %d\n", temp -> data);
  31. free(temp);
  32. }
  33. }
  35. void display()
  36. {
  37. if (front == NULL)
  38. printf("\nQueue is Empty!\n");
  39. else {
  40. struct Node *temp = front;
  41. while (temp -> next != NULL) {
  42. printf("%d--->", temp -> data);
  43. temp = temp -> next;
  44. }
  45. printf("%d--->NULL\n", temp -> data);
  46. }
  47. }
  49. void main()
  50. {
  51. int choice, value;
  52. while(1) {
  53. printf("\nQueue using Linked List\n");
  54. printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n");
  55. printf("Enter your choice: ");
  56. scanf("%d", &choice);
  57. switch(choice) {
  58. case 1: printf("Enter the value to be inserted: ");
  59. scanf("%d", &value);
  60. enQueue(value);
  61. break;
  62. case 2: deQueue();
  63. break;
  64. case 3: display();
  65. break;
  66. case 4: exit(0);
  67. default: printf("\nWrong choice. Please try again\n");
  68. }
  69. }
  70. }</stfio.h>
#inlcude <stfio.h><br><br>struct Node
{
   int data;
   struct Node *next;
}*front = NULL, *rear = NULL;

void enQueue(int value)
{
  struct Node *newNode;
  newNode = (struct Node*)malloc(sizeof(struct Node));
  newNode -> data = value;
  newNode -> next = NULL;
  if (front == NULL)
    front = rear = newNode;
  else {
    rear -> next = newNode;
    rear = newNode;
  }
  printf("\nInsertion is Successful\n");
}

void deQueue()
{
  if (front == NULL)
    printf("\nUnderflow. Queue is Empty\n");
  else
  {
    struct Node *temp = front;
    front = front -> next;
    printf("\nDeleted element: %d\n", temp -> data);
    free(temp);
  }
}

void display()
{
  if (front == NULL)
    printf("\nQueue is Empty!\n");
  else {
    struct Node *temp = front;
    while (temp -> next != NULL) {
      printf("%d--->", temp -> data);
      temp = temp -> next;
    }
    printf("%d--->NULL\n", temp -> data);
  }
}

void main()
{
  int choice, value;
  while(1) {
    printf("\nQueue using Linked List\n");
    printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n");
    printf("Enter your choice: ");
    scanf("%d", &choice);
    switch(choice) {
      case 1: printf("Enter the value to be inserted: ");
              scanf("%d", &value);
              enQueue(value);
              break;
      case 2: deQueue();
              break;
      case 3: display();
              break;
      case 4: exit(0);
      default: printf("\nWrong choice. Please try again\n");
    }
  }
}</stfio.h>

 

Scroll to top

By using this website you agree to accept our Privacy Policy and Terms and Conditions