pop.c

堆栈的基本功能实现,链表方式实现

#include "head.h"
JD *pop(JD *phead,JD *ptemp,JD *ptop)
{
	if(ptop == NULL)
	{
		printf("栈空\n");
	}
	else
	{
		ptemp->value = ptop->value;
		phead->next = ptop->next;
		ptop = phead->next;
	}
	return(ptop);
}