C语言单链表实现栈

最近复习数据结构，练手代码，能运行就上传了

#include <stdio.h>
#include <stdlib.h>
/*by xuyongqi*/


/*单链表实现栈*/

typedef struct node {
	void* data;
	struct node *next;
}node;

typedef struct stack {
	node *head;
	int size;
}stack;
 
 /*初始化*/
void* init()
{
	stack* st = (stack*)malloc(sizeof(stack));
	if(st == NULL) return NULL;
	st->head = NULL;
	st->size = 0;
	return st;
}

 /*销毁栈*/
void destory(void *st)
{
	if(st == NULL) return;
	stack *p =(stack*)st;
	node *del = p->head;
	node *temp = NULL;
	while (del != NULL)
	{
	   temp = del->next;
	   free(del);
	   del = temp;
	}
	free(p);
	p = NULL;
}

 /*压栈*/
void push(void *st, void *data)
{
	if(st ==NULL || data ==NULL) return;
	stack *p =(stack*)st;
	node *new_node = (node*)malloc(sizeof(node));
	new_node->next = NULL;
	new_node->data = data;

	if (p->head == NULL)
	{
	    p->head = new_node;
	} else {
	    new_node->next = p->head;
	    p->head = new_node;
	}     
	p->size++;
}

 /*弹栈*/
void pop(void *st)
{
	if (st== NULL) return;
	stack *p =(stack*)st;
	if (p->size == 0) return;

	node *del = p->head;
	p->head=del->next;
	free(del);
	del = NULL;
	p->size--;
}

 /*返回栈顶元素*/
void* top(void *st)
{
	if (st== NULL) return NULL;
	stack *p =(stack*)st;
	if (p->size == 0) return NULL;
	return p->head->data;
}

/*栈是否为空*/
int empty(void *st)
{
	if (st== NULL) return 0;
	stack *p =(stack*)st;
	return p->size == 0;
}

/*栈中元素个数*/
int size(void *st)
{
	if (st== NULL) return -1;
	stack *p =(stack*)st;
	return p->size;
}

int main()
{
	int d1 = 1;
	int d2 = 2;
	int d3 = 3;
	int d4 = 4;
	int d5 = 5;
	stack *s= init();

	push(s, &d1);
	push(s, &d2);
	push(s, &d3);
	push(s, &d4);
	push(s, &d5);

	while(!empty(s))
	{
	    int *i = (int*)top(s);
	    printf("top %d \n", *i);
	    pop(s);
	}
	destory(s);
}