数据结构：链式栈的C语言代码实现

/*
* 使用链表实现，考虑在链表头部操作还是尾部操作，当在尾部进行删除操作时，会无法找到它的前一个结点，因此以头部为栈顶
* 因为是动态分配内存，所以要考虑分配内存失败的问题，同时还要考虑释放内存
* s只是一个头，不含任何元素
	实现操作：1.建立空栈
			  2.销毁栈,定义一个指针p指向头结点，头结点指向后方的结点，然后释放p的内存。直到头结点后无结点时，释放头结点
			  3.压栈，生成一个结点，赋值数据之后，让其指向头结点后方的元素，再让头结点指向生成的结点。考虑结点分配失败，返回错误信息。
			  4.返回栈的长度，遍历栈，遍历一次计数加1。注意头结点不属于栈。改进方法:头结点内增加一个int类型数据，初始属性为0，每插入一个数据，int+1
			  5.返回栈顶元素
			  6.遍历栈
*/
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct Stack
{
	int data;
	struct Stack* next;
};

//建立空栈，返回头结点
struct Stack* CreatStack(struct Stack* s);

//销毁栈
void DestroyStack(struct Stack* s);

//压栈操作
struct Stack* push(struct Stack* s, int elem);

//弹栈操作
struct Stack* pop(struct Stack* s);

//判断栈是否为空
int isEmpty(struct Stack* s);

//返回栈的长度
int StackLength(struct Stack* s);

//返回栈顶元素
int GetTop(struct Stack* s);

//遍历栈
void visit(struct Stack* s);

int main()
{
	struct Stack* s;
	s = (struct Stack*)malloc(sizeof(struct Stack));
	s = CreatStack(s);
	s = push(s, 12);
	printf("压入Stack内的元素:%d\n", s->next->data);
	printf("Stack顶部元素:%d\n", GetTop(s));
	s = push(s, 13);
	printf("栈内元素的个数:%d\n", StackLength(s));
	printf("遍历栈内元素:\n");
	visit(s);
	
	s = pop(s);
	s = pop(s);
	s = pop(s);

	DestroyStack(s);

	return 0;
}

struct Stack* CreatStack(struct Stack* s)
{
	s = (struct Stack*)malloc(sizeof(struct Stack));
	if (!s)
	{
		exit(OVERFLOW);
	}
	else
	{
		s->next = NULL;
		return s;
	}
}

void DestroyStack(struct Stack* s)
{
	struct Stack* p;
	while (s->next!=NULL)
	{
		p = s;
		s = s->next;
		free(p);
	}
	free(s);
	printf("Stack已经释放\n");
}

struct Stack* push(struct Stack* s, int elem)
{
	struct Stack* node;
	node = (struct Stack*)malloc(sizeof(struct Stack));
	if (!node)
	{
		exit(OVERFLOW);
	}
	node->data = elem;
	node->next = s->next;
	s->next = node;
	return s;
}

struct Stack* pop(struct Stack* s)
{
	if (isEmpty(s))
	{
		printf("无法弹栈\n");
		return s;
	}
	else
	{
		struct Stack* node;
		node = s->next;
		int elem = node->data;
		printf("弹出栈顶元素:%d\n", elem);
		s->next = node->next;
		free(node);
		return s;
	}
}

int isEmpty(struct Stack*s)
{
	if (s->next == NULL)
	{
		printf("空栈");
		return 1;
	}
	else
	{
		return 0;
	}
}

int StackLength(struct Stack* s)
{
	int len=0;
	while (s->next!=NULL)
	{
		len++;
		s = s->next;
	}
	return len;
}

int GetTop(struct Stack* s)
{
	if (isEmpty(s))
	{
		return 0;
	}
	else
	{
		return s->next->data;
	}
}

void visit(struct Stack* s)
{
	while (s->next!=NULL)
	{
		printf("%d ", s->next->data);
		s = s->next;
	}
	printf("\n\n");
	return 0;
}

运行结果