数据结构之链表栈

 

//链表栈
#include<stdio.h>
#include<stdlib.h>
#define MaxSize 5
#define ElemType int

typedef struct node{
ElemType data;
struct node *next;
}listStack;

//创造头节点
listStack *createHead()
{
listStack *HeadNode=(listStack *)malloc(sizeof(listStack));
HeadNode->next=NULL;
HeadNode->data=0;
return HeadNode;
}

//创造新的节点
listStack *create_node(ElemType target)
{
listStack *newNode=(listStack *)malloc(sizeof(listStack));
newNode->data=target;
newNode->next=NULL;
}

//和链表头插法毫无区别
void push_node(listStack *head,ElemType target)
{
listStack *newNode=create_node(target);

newNode->next=head->next;
head->next=newNode;
}

//弹出那不就是删除一号位置的元素？
void Pop_node(listStack *head,ElemType *target)
{
if(head->next==NULL)return;
*target=head->next->data;
head->next=head->next->next;
}

void show_stacklist(listStack *head)
{
listStack *pMove=head->next;
while(pMove)
{
printf("%d ",pMove->data);
pMove=pMove->next;
}
printf("\n");
}

int main()
{
listStack *head;
int cot=5;
while(cot--)
{
push_node(head,cot);
}
show_stacklist(head);

int target;
Pop_node(head,&target);
show_stacklist(head);

return 0;
}