栈的链式存储和操作实现

#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED
typedef int ElemType;
typedef struct SingleNode
{
	ElemType data;
	struct SingleNode* next;
}Stack;
#endif
 

#include <stdio.h>
#include <stdlib.h>
#include "Stack.h"
/*************************************/
//初始化链栈
/*************************************/
void initStack(Stack* S,int ms)
{
	S->next=NULL;
 } 
/*************************************/
//向链栈中插入如一个元素
/*************************************/
void push(Stack* S,ElemType item)
{
	Stack* p=malloc(sizeof(Stack));
	p->data=item;
	p->next=S->next;
	S->next=p;
 }
/**************************************/
//从栈链中删除一个元素并返回
/**************************************/
ElemType pop(Stack* S)
{
	if(S->next==NULL)
	{
	  printf("Linked stack is empty! exit");
	  exit(1);	
	}
	Stack* p=S->next;
	ElemType x=p->data;
	S->next=p->next;
	free(p);
	return x;
 }
/****************************************/
//读取栈顶元素
/****************************************/
ElemType peek(Stack* S)
{
	if(S->next==NULL)
	{
		printf("Linked stack is empty! exit");
		exit(1);
	}
	return S->next->data;
 } 
/****************************************/
//检查栈链是否为空
/****************************************/
int emptyStack(Stack* S)
{
	return S->next==NULL;
 }
/****************************************/
//清除栈链为空
/****************************************/
void clearStack(Stack* S)
{
	Stack* p=S->next;
	while(p!=NULL)
	{
		Stack* q=p->next;
		free(p);
		p=q;
	}
	S->next=NULL;
 } 
/******************************************/
 

#include <stdio.h>
#include <stdlib.h>
#include "Stack.h"
#include "栈在链接存储下运算的算法.c"

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char *argv[]) 
{
    int i,x,y,z;
	int a[8]={3,8,5,17,9,30,15,22};
	Stack r,*S=&r;
	
	initStack(S,1);
	
	for(i=0;i<8;i++)
	{
		push(S,a[i]);
	
	}
	x=pop(S);
	y=pop(S);
	z=pop(S);
	printf("%d %d %d\n",x,y,z);
	push(S,68);
	x=peek(S);
	y=pop(S);
	z=peek(S);
	printf("%d %d %d\n",x,y,z);
	
	push(S,60);
	
	while(!emptyStack(S))
	{
		printf("%d",pop(S));
		printf("\n");
	}
	clearStack(S);
	return 0;
}