**

顺序栈可以用一个一维数组和一个记录栈顶位置的整形变量来实现，数组用于顺序存储栈中所有的数据元素，栈顶指针用于存储栈顶元素的位置。

**
头文件（Sqstack.h）：

#ifndef __SQSTACK_H__
#define __SQSTACK_H__#include "error.h"#define TRUE  1
#define FALSE 0#define SIZE  10
typedef int StackData;
typedef struct _stack
{StackData data[SIZE];       // 栈数组int top;
}Stack;// 置空栈
int InitStack  (Stack* s);// 判栈是否空栈
int StackEmpty (Stack* s);// 判栈是否栈满
int StackFull  (Stack* s);// 进栈
int Push (Stack* s, StackData x);// 出栈
int Pop  (Stack* s, StackData *x);// 取栈顶
int GetTop (Stack* s, StackData *x);#endif

源文件（Sqstack.c）：

#include "SqStack.h"// 置空栈
int InitStack (Stack* s)
{if (NULL == s){errno = ERROR;return FALSE;}s->top = -1;
}// 空返回真，否则返回假
int StackEmpty (Stack* s)
{if (NULL == s){errno = ERROR;return FALSE;}return s->top == -1;
}// 满则返回真，否则返回假
int StackFull (Stack* s)
{if (NULL == s){errno = ERROR;return FALSE;}return s->top == (SIZE - 1);
}// 进栈
int Push (Stack* s, StackData x)
{if (NULL == s){errno = ERROR;return FALSE;}// 判断是否栈满if (StackFull(s)){errno = FULL_STACK;return FALSE;}// 先进行x的存储s->data[++s->top] = x;      return TRUE;
}// 出栈
int Pop (Stack* s, StackData *x)
{if (NULL == s){errno = ERROR;return FALSE;}// 判断是否空栈if (StackEmpty(s)){errno = EMPTY_STACK;return FALSE;}*x = s->data[s->top--];return TRUE;
}// 取栈顶
int GetTop (Stack* s, StackData *x)
{if (NULL == s){errno = ERROR;return FALSE;}//判断是否空栈if (StackEmpty(s)){errno = EMPTY_STACK;return FALSE;}*x = s->data[s->top];return TRUE;
}