LinkList_Stack（链式栈）

#include<stdio.h>
typedef int Datatype;
typedef struct link_node {
Datatype info;
struct link_node *next;
}node;


node *init()
{
return NULL;
}


int empty(node *top)
{
return (!top ? 1 : 0);
}


Datatype read(node *top)
{
if (!empty(top))
return top->info;
else
{
printf("栈为空！\n");
return NULL;
}
}


void display(node *top)
{
if (!top)
printf("栈为空，无法进行输出！\n");
else
{
node *p = top;
while (p)
{
printf("%5d", p->info);
p = p->next;
}
}
}


node *insert(node *top, Datatype x)
{
node *p, *q;
p = (node *)malloc(sizeof(node));
p->info = x;
p->next = NULL;
if (top == NULL)
top = p;
else
{
p->next = top;
top = p;
}
return top;
}




node *dele(node *top)
{
node *p = top;
if (!p)
printf("栈为空，无法进行删除！\n");
else
{
top = top->next;
free(p);
}
return top;
}




void main()
{
node *top;
top = init();
int i;;
for (i = 0; i<10; i++)
top = insert(top, i * 2);
display(top);
putchar('\n');
printf("栈顶结点的值为：%d\n", top->info);
top = insert(top, 666);
printf("666进栈：");
display(top);
putchar('\n');
top= dele(top);
printf("删除栈顶的结点后为：");
display(top);
putchar('\n');
top = dele(top);
printf("删除栈顶的结点后为：");
display(top);
putchar('\n');
}