Question

C PROGRAMMING -- Please use simple code

QUESTION: -

Write a charQueue header file containing all the function headers of following functions:
1- initiateQueue—to initialize a queue

2- enqueue—to add a node at the rear end of the queue

3- dequeue—to remove a node from the front of the queue

4- printQueue—print a queue

and an implementation file implementing these functions for a Queue of chars. Inside your main method, which should be part of your tester file, read a sequence of chars one at a time. Terminate your sequence if user enters the number 0. Remember the difference between a char and an int!

Print the text user entered (that was stored in your Queue as a series of characters) using a while loop. You should loop as long as the Queue is not empty.  

Answer 1

Please go through code and output.

CODE:

########################################################

//CharQueue.h

#ifndef CHAR_QUEUE_H
#define CHAR_QUEUE_H
#include <stdio.h>
#include <stdlib.h>
/* structure */
typedef struct Queue
{
   char ch;
   struct Queue * next;
}queue;

queue * initiateQueue(char ch);
void enqueue(char ch,queue ** head);
char dequeue(queue ** head);
void printQueue(queue * head);

#endif

-------------------------------------------------------------------------------------

//charQueue.c

#include <stdio.h>
#include <stdlib.h>
#include "CharQueue.h"
/* functions defination */
queue * initiateQueue(char ch)
{
   queue * temp = (queue *)malloc(sizeof(queue));
   temp->ch = ch;
   temp->next = NULL;
   return temp;
}
void enqueue(char ch,queue ** head)
{
   queue * temp = *head;
   queue * temp1 = (queue *) malloc(sizeof(queue));
   temp1->ch = ch;
   temp1->next = NULL;
   if(*head == NULL)
   {
       temp1->next = (*head)->next;
       *head = temp1;
   }
   else
   {
       while(temp->next != NULL)
       {
           temp = temp->next;
       }
       temp1->next = temp->next;
       temp->next = temp1;

   }

}
char dequeue(queue ** head)
{
   char ch;
   queue * temp = *head;
   if(*head == NULL)
   {
       printf("Queue is in underflow condition\n");
   }
   else
   {
       temp = *head;
       *head = (*head)->next;
       ch = temp->ch;
       free(temp);
   }
   return ch;
}
void printQueue(queue * head)
{
   queue * temp = head;
   while(temp != NULL)
   {
       printf("%c ",temp->ch);
       temp = temp->next;
   }

printf("\n");
}

int main()
{
   queue * head = NULL;
   head = initiateQueue('a');
   enqueue('b',&head);
   enqueue('c',&head);
   enqueue('d',&head);
   printf("dequeue - %c\n",dequeue(&head));
   enqueue('e',&head);
   enqueue('f',&head);
   printQueue(head);
}
############################################################

OUTPUT: