一、棧的概念
1.棧是限定僅在表尾進行插入和刪除操作的線性表。先進后出、后進先出
????????棧頂:允許操作的一端
????????棧底:不允許操作的一端入棧，出棧。
????????棧分為：順序棧 鏈式棧
2.棧結構是在堆區創建的
3.優先級就是通過棧來解決的
先進后出，后進先出。

二、隊列的概念
1.隊列是只允許在一段進行插入，而在另一端進行刪除操作的線性表。
????????允許插入的稱謂隊尾，允許刪除的一端隊頭。
? ? ? ? 隊列分為：順序隊列，循環隊列，
????????常用操作：出隊、入隊。
????????先進先出，FIFO
2.滿隊：尾 + 1 = 頭
3.空隊：尾 = 頭
4.隊列又叫緩沖

三、練習與例題
1.創建棧

LinkStack *CreateLinkStack()
{LinkStack *ls = (LinkStack *)malloc(sizeof(LinkStack));if(NULL == ls){fprintf(stderr, "CreateLinkStack malloc");return NULL;}ls->top = NULL;ls->clen = 0; return ls;
}

2.入棧（頭插法）

int PushLinkStack(LinkStack *ls, DATATYPE *data) //入棧
{LinkStackNode *newnode = (LinkStackNode *)malloc(sizeof(LinkStackNode));if(NULL == ls){fprintf(stderr, "CreateLinkStack malloc");return 1;}int len = GetSizeLinkStack(ls);memcpy(&newnode->data, data, sizeof(DATATYPE));newnode->next = NULL;newnode->next = ls->top;ls->top = newnode;ls->clen++;return 0;
}

3.銷毀棧區

int DestoryLinkStack(LinkStack *ls)
{LinkStackNode *tmp = ls->top;while(tmp){ls->top = ls->top->next;free(tmp);tmp = ls->top;}free(ls);return 0;
}

4.獲取棧區的內容

DATATYPE *GetTopLinkStack(LinkStack *ls)
{if(IsEmptyLinkStack(ls)){return NULL;}return &ls->top->data;
}

5.出棧（頭刪）

int PopSeqStack(LinkStack *ls) // 頭刪
{if(IsEmptyLinkStack(ls)){return 1;}LinkStackNode *tmp = ls->top;ls->top = ls->top->next;free(tmp);ls->clen--;return 0;
}

6.主函數運行

int main(int argc, char *argv[])
{LinkStack *ls = CreateLinkStack();DATATYPE data[] = {{"maodan", 'F', 20, 80},  {"xiaofan", 'M', 21, 83},{"jett", 'F', 22, 83},   {"viper", 'M', 40, 90},{"runa", 'M', 41, 92}, {"gpw", 'F', 32, 63},};int i;for(i = 0; i < 6; ++i){PushLinkStack(ls, &data[i]);} int len = GetSizeLinkStack(ls);for(i = 0; i < len; ++i){DATATYPE *tmp = GetTopLinkStack(ls);printf("%s %c %d %d\n",tmp->name,tmp->sex,tmp->age,tmp->score);PopSeqStack(ls);}DestoryLinkStack(ls);ls = NULL;return 0;
}

7.隊列為空

int IsEmptySeqQue(SeqQueue *sq)
{ return sq->head == sq->tail; 
}

8.隊列為滿

int IsFullSeqQue(SeqQueue *sq) 
{ return (sq->tail + 1) % sq->tlen == sq->head; 
}

9.入隊

int EnterSeqQue(SeqQueue *sq, DATATYPE *data) 
{if (IsFullSeqQue(sq)) {fprintf(stderr, "EnterSeqQue full\n");return 1;}memcpy(&sq->array[sq->tail], data, sizeof(DATATYPE));sq->tail = (sq->tail + 1) % sq->tlen;return 0;
}

10.銷毀隊列

int DestroySeqQue(SeqQueue *sq) 
{free(sq->array);free(sq);return 0;
}

11.創建隊列

SeqQueue *CreateSeqQue(int len) 
{SeqQueue *sq = (SeqQueue *)malloc(sizeof(SeqQueue));if (NULL == sq) {fprintf(stderr, "CreateSeqQue malloc\n");return NULL;}sq->array = malloc(sizeof(DATATYPE) * len);if (NULL == sq->array) {fprintf(stderr, "CreateSeqQue malloc\n");return NULL;}sq->head = 0;sq->tail = 0;sq->tlen = len ;return sq;
}