/*Implementing a Queue Using a Linked List*/
/*which reads an integer and prints its digits in reverse order.
For example, if 12345 is read, the program prints 54321. The digits are extracted, from the right, and stored in a queue.The items in the queue are taken off, one at a time, and printed.*/
#include <stdlib.h>
#include <stdio.h>
typedef struct {
int num;
} QueueData;
typedef struct node {
QueueData data;
struct node *next;
} Node, *NodePtr;
typedef struct queueType {
} QueueType, *Queue;
Queue initQueue() {
Queue qp = (Queue) malloc(sizeof(QueueType));
qp -> tail = NULL;
return qp;
} //end initQueue
int empty(Queue Q) {
return (Q -> head == NULL);
} //end empty
void enqueue(Queue Q, QueueData d) {
NodePtr np = (NodePtr) malloc(sizeof(Node));
np -> data = d;
np -> next = NULL;
if (empty(Q)) {
Q -> tail = np;
}
else {
Q -> tail -> next = np;
Q -> tail = np;
}
} //end enqueue
QueueData dequeue(Queue Q) {
if (empty(Q)) {
printf("\nAttempt to remove from an empty queue\n");
exit(1);
}
QueueData hold = Q -> head -> data;
NodePtr temp = Q -> head;
if (Q -> head == NULL) Q -> tail = NULL;
free(temp);
return hold;
} //end dequeue
main() {
int n;
QueueData temp;
Queue Q = initQueue();
printf("Enter a positive integer: ");
scanf("%d", &n);
while (n > 0) {
temp.num = n % 10;
enqueue(Q, temp);
n = n / 10;
}
printf("\nDigits in reverse order: ");
while (!empty(Q))
printf("%d", dequeue(Q).num);
printf("\n");

} //end main ##### Bhanu Namikaze

Bhanu Namikaze is an Ethical Hacker, Security Analyst, Blogger, Web Developer and a Mechanical Engineer. He Enjoys writing articles, Blogging, Debugging Errors and Capture the Flags. Enjoy Learning; There is Nothing Like Absolute Defeat - Try and try until you Succeed.