nisarg.c

#include<stdio.h>
//#include<queue.h> this is bydefault existed
#define MaxQ 10

typedef struct
{
	int head,tail;
	int QA[MaxQ];
	
}QType,*Queue;

Queue initQueue();
int empty(Queue Q);
void enqueue(Queue Q,int n);
int dequeue(Queue Q);

Queue initQueue()
{
	Queue qp = (Queue)malloc(sizeof(QType));
	
	qp->head=qp->tail=0;
	return qp;
}

int empty(Queue Q)
{
	return(Q->head==Q->tail);
	
}

void enqueue(Queue Q,int n)
{
	if(Q->tail==MaxQ-1)
	{
		Q->tail=0;
		
	}
	else
	{
		++(Q->tail);
	}
	if(Q->tail==Q->head)
	{
		printf("\nQueue is full");
		exit(1);
		
	}
	Q->QA[Q->tail]=n;
}

int dequeue(Queue Q)
{
	if(empty(Q))
	{
		printf("\nAttempt to remove from an empty queue........\n");
		exit(1);
	}
	if(Q->head==MaxQ-1)
	{
		Q->head=0;
	}
	else
	{
		++(Q->head);
	}
	return Q->QA[Q->head];
}
 main()
 {
 	int n;
 	Queue Q = initQueue();
 	printf("Enter the positive integer : ");
 	scanf("%d",&n);
 	while(n>0)
 	{
 		enqueue(Q,n%10);
 		n=n/10;
 		
	 }
	 printf("\nDigit in reverse");
	 while(!empty(Q))
	 {
	 	printf("%d",dequeue(Q));
	 }
	 printf("\n\n");
	 system("pause");
 }