stackandqueue.h

Algorithm Hamilton I do with C++.It is easy for you

#ifndef _STACKANDQUEUE_H_
#define _STACKANDQUEUE_H_
#include <conio.h>
#include <iostream.h>
typedef struct tagnode
{
	int info;
	tagnode *pnext;
}node;
typedef struct taglist
{
	node *phead;
	node *ptail;
}LIST;
//ham khoi tao danh sach
void InitList(LIST &l);


//ham kiem tra danh sach rong
int IsEmptyList(LIST l);

//tao mot node moi
node *makenode(int a);

//ham chen phan tu dau tien
void InsertHead(LIST &l,int x);
//ham chen vao cuoi

void InsertTail(LIST &l,int x);
//ham xoa phan tu dau tien trong danh sach
void RemoveFirst(LIST &l);

//ham khoi tao stack
void InitStack(LIST &stack);

//ham kiem tra danh sach rong
int IsEmptyStack(LIST stack);

//them mot phan tu vao ngan xep
void Push(LIST &stack,int x);

//ham lay thong tin o dinh ngan xep
int Top(LIST stack);

//lay thong tin va huy phan tu o dinh ngan xep
int Pop(LIST &stack);

//tao hang doi rong
void InitQueue(LIST &queue);

//kiem tra han doi rong
int IsEmptyQueue(LIST queue);

//them mot phan tu vao cuoi hang doi
void EnQueue(LIST &queue,int x);

//lay thong tin phan tu o dau hang doi
int Front(LIST queue);

//Lay thong tin va huy pha ntu o dau hang doi
int DeQueue(LIST &queue);



#endif