ภาษา C ขอแจม...ครับ (Data Structure) ใครพอจะเทพ ภาษา C บ้างครับ แบบ...

// ภาษา C ครับ
...
#define MAX 10

typedef enum Bool{false=0, true=1} TBool;
struct StdElement{
	int id;
	char name[10];
	int math,stat,com;
};
TBool IsEmpty(int,int);
TBool IsFull(int,int);
void EnQueue(struct StdElement *, struct StdElement, int *);
void DeQueue(struct StdElement *, struct StdElement, int *);
char ShowMenu(void);
void ShowData(struct StdElement *, int, int, int);

int main(){
	struct StdElement *QUEUE,tmp;
	char choice;
	int head, tail;
	head=tail=1;
	
	while((choice=ShowMenu()) != '9'){
		switch(choice){
			case '1' :
				if(IsFull(tail,MAX) != true){
					printf("\nEnter ID : "),scanf("%d",&tmp.id);
					printf("Enter Name : "),scanf("%s",&tmp.name);
					printf("Enter Math Score : "),scanf("%d",&tmp.math);
					printf("Enter Stat Score : "),scanf("%d",&tmp.stat);
					printf("Enter Comp Score : "),scanf("%s",&tmp.com);
					EnQueue(QUEUE,tmp,&tail);
					printf("\nInsert Data comlete !");
					ShowData(QUEUE,head,tail,MAX);
				}else{
					printf("\n\nStack Full !!!");
				}
				getch();
				break;
			case '2':
				if(IsEmpty(head,tail) != true){
					DeQueue(QUEUE,tmp,&head);
					printf("\n\nRetvie data is : %d,%s,%d,%d,%d\n\n",tmp.id,tmp.name,tmp.math,tmp.stat,tmp.com);
				}else{
					printf("\n\nCan't retrive data,Stack was empty !!!");
				}
				ShowData(QUEUE,head,tail,MAX);
				getch();
				break;
			case '3':
				ShowData(QUEUE,head,tail,MAX);
				getch();
				break;
			case '4':
				printf("\n\nPlease select 1,2,3,4 or 9 only !!!\n");
				printf("\n\nQueue was clear.\n\n");
				ShowData(QUEUE,head,tail,MAX);
				getch();
				break;
		/*	case '5':
				printf("\nEnter number of Queue :"),scanf("%d",MAX);
				printf("\nSave Number success !\n");
				getch();
				break;
		*/
			default:
				printf("\n\nPlease select 1,2,3,4 or 9 Only !!!\n");
				getch();
		}
	}
	return 0;
}
TBool IsFull(int tail, int max){
	if(tail == max-1)
		return true;
	else
		return false;
}
TBool IsEmpty(int head, int tail){
	if(head == tail)
		return true;
	else
		return false;
}
void EnQueue(struct StdElement *queue, struct StdElement tmp, int *tail){
	*tail = *tail+1;
	queue[*tail] = tmp;
}
void DeQueue(struct StdElement *queue, struct StdElement tmp, int *tail){
	*tail = *tail+1;
	queue[*tail] = tmp;
}
char ShowMenu(void){
	clrscr();
	printf("***************************************************\n");
	printf("****************  Using Queue  ********************\n");
	printf("***************************************************\n");
	printf("1.Enqueue Data\n");
	printf("2.Dequeue Data\n");
	printf("3.Show Queue\n");
	printf("4.Clear Queue\n");
	printf("5.Insert Number Queue\n");
	printf("9.Quit\n");
	printf("***************************************************\n");
	printf("Please select 1,2,3,4 or 9 only :\n");
	printf("***************************************************\n");
	printf("Please select choice : ");
	return getche();
}
void ShowData(struct StdElement *queue, int head, int tail, int max){
	int idx;
	if(head == tail)
		printf("\n\nQueue is Empty !!!\n");
	printf("\n===================================================\n");
	printf("\n==========  Current Student Data in Queue =========\n");
	printf("\n===================================================\n");
	for(idx=0;idx<max;idx++){
		if(idx>head && idx<=tail && head != tail)
			printf("\n=->= %-5d%-10s%5d%5d%5d =",queue[idx].id,queue[idx].name,queue[idx].math,queue[idx].stat,queue[idx].com);
	}
	printf("\n===================================================\n");
	printf("\n===================  End of Queue =================\n");
	printf("\n===================================================\n");
}