queue ----also use array[] and link pointer

<span style="font-family:SimSun;font-size:10px;">#include<stdio.h></span>

#include<stdlib.h>


typedef struct node_s {
	char data;
	struct node_s *next;
}node_s,*node_ptr_t;

node_ptr_t first,last;
	
int isEmpty()
{
	return first->next==NULL;
}
node_ptr_t new_node()
{
	node_ptr_t p=(node_ptr_t)malloc(sizeof(node_s));
	p->next=NULL;
	return p;
}
void enqueue(char c)
{
	node_ptr_t oldfirst=last;
	last = new_node();
	last->data=c;
	last->next=NULL;
	if(isEmpty())
	{
		first=last;
	}
	else
		oldfirst->next=last;
}
void dequeue()
{
	char temp=first->data;
	first=first->next;
	if(isEmpty())
		last=NULL;
	printf("%c",temp);
}

void main()
{
	enqueue('t');
	enqueue('o');
	enqueue(' ');
	enqueue('u');
	dequeue();
	enqueue('m');
	enqueue('e');
	dequeue();
	dequeue();
	dequeue();
	dequeue();
	
	
}

#include<stdio.h>
#define MAX 100
int N=0;
char s[MAX];
int head=0;
int tail;
int is_empty()
{
	return N==0;
}
void enqueue(char ch)
{
	s[N++]=ch;
	tail=N;
}
char dequeue()
{
	if(is_empty())
		return -1;
	else
	{
		//putchar(s[head]);
		printf("%c",s[head]);
		head=head+1;
	}
}
void main()
{
	enqueue('t');
	enqueue('o');
	enqueue(' ');
	enqueue('u');
	dequeue();
	enqueue('m');
	enqueue('e');
	dequeue();
	dequeue();
	dequeue();
	dequeue();
	

}