sl.cpp

来自「数据结构中所有算法的实现」· C++ 代码 · 共 46 行

#include "d:\cpp\head.h"
typedef int ElemType;
typedef struct LNode{
  ElemType data;
  struct LNode *next;
}LNode,*LinkStack;

Status InitStack(LinkStack &S){
  S=(LNode*)malloc(sizeof(LNode));
  if(!S)return ERROR;
  S->next=NULL;
  S->data=0;
  return OK;
}
Status Push(LinkStack &S,ElemType e){
  LNode *p;
  p=(LNode*)malloc(sizeof(LNode));
  if(!p)return ERROR;
  p->data=e;
  p->next=S->next;
  S->next=p;
  S->data++;
  return OK;
}
Status Pop(LinkStack &S,ElemType &e){
  LNode *p;
  p=S->next;
  if(!p)return ERROR;
  e=p->data;
  S->next=p->next;
  S->data--;
  free(p);
  return OK;
}
Status GetTop(LinkStack &S,ElemType &e){
  LNode *p;
  p=S->next;
  if(!p)return ERROR;
  e=p->data;
  return OK;
}
Bool Empty(LinkStack S){
  if(S->next==NULL)return TRUE;
  else return FALSE;
}