栈基本操作

PS1：

顺序栈：

//ADT Stack
//line
#define MaxStackSize 100
typedef int ElemType;
typedef struct
{
 ElemType stack[MaxStackSize];
 int top;
}Stack;
void InitStack(Stack *S)
{
 if((S=(Stack*)malloc(sizeof(Stack)))==NULL)
  exit(OVERFLOW);
 S->top=-1;
}
int StackEmpty(Stack S)
{
 if(S.top==-1)
  return 1;
 else return 0;
}
void StackPush(Stack*S,ElemType elem)
{
 if(S->top==MaxStackSize-1)
 {
  pritnf("%d","Stack is full");
  exit(0);
 }
 else
 S-top++;
 S->top=elem;
}
void StackPop(Stack *S ,ElemType * elem)
{
 if(StackEmpty(*S))
 {
  printf("Stack is empty");
  exit(0);
 }
 else
 *elem=S->top--;
}
void Gettop(Stack S,ElemType * elem)
{
 if(StackEmpty(*S))
 {
  printf("Stack is empty");
  exit(0);
 }
 else
 *elem=S.top;
}

PS2：

链式栈：

//ADT Stack
//Node
typedef int ElemType;
typedef struct
{
 ElemType data;
 Struct StackNode *next;
}StackNode;
typedef struct
{
 StackNode *top;
 int length;
}Stack;
void InitStack(Stack *S)
{
 S->top=NULL;
}
void Push(Stack *S,ElemType elem)
{
 p=(StackNode*)malloc(sizeof(StackNode));
 if(!p)
 exit(OVERFLOW);
 else
 {
  p->data=elem;
  p->next=S->top;
  S->top=p;
 }
}
void Pop(Stack *S,ElemType &elem)
{
 if(StackEmpty(*S))
  exit("Stack is empty");
 else
 {
  elem=S->top->data;
  p=S->top;
  S->top=p->next;
  free(p);
 }
}
void GetTop(Stack S,ElemType &elem)
{
 if(StackEmpty(S))
  exit("Stack is empty");
 else
  elem=S.top->data;
}
int StackEmpty(Stack S)
{
 if(S.top==NULL)
  return 1;
 else
  return 0;
}