栈

//编程实现栈的入栈
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <conio.h>
using namespace std;


typedef struct student
{
int data;
struct student *next;
}node;


typedef struct stackqueue
{
node *zhandi,*top;
}queue;


//栈的入栈
queue *push(queue *HQ,int x)
{
node *s,*p;
s=(node*)malloc(sizeof(node));
s->data = x;
s->next = NULL;


if (HQ->zhandi == NULL)//如果栈底为空
{
HQ->zhandi = s;
HQ->top = s;
}
else
{
HQ->top->next = s;//栈顶的下一个为s（其实这个就是设置为原先的栈顶的下一个为s）
HQ->top = s;     //把栈顶设置为s;功能相当于刷新一下
}


return (HQ);
}


//编程实现栈的出栈
queue *pop(queue *HQ)
{
node *p; int x;
if (HQ->zhandi ==NULL)//栈为空
{
printf("\n yichu");
}
else//栈不为空
{
x=HQ->zhandi->data;
p=HQ->zhandi;


if (HQ->zhandi == HQ->top)//删除后栈为空的情况
{
HQ->zhandi =NULL;
HQ->top = NULL;
}
else
{
while (p->next != HQ->top)
{
p=p->next;
}
HQ->top =p;
HQ->top>next =NULL;
}

return (HQ);
}
}


//编程实现栈的测长


int length(node *HQ)
{
int n=0;
node *p;
p=HQ;
while (p!=NULL)
{
p=p->next;
n++;
}
return (n);
}


//编程实现打印栈
void print(queue *HQ)
{
node *p;
int n;
p=HQ->zhandi;


while (p != NULL)
{
printf("\n   uuu %d ",p->data);
p=p->next;
}
}




int main()
{
node stud;
queue *HQ;
int n,pop_num,push_num;
HQ=(queue *)malloc(sizeof(queue));
HQ=push(HQ,1);
HQ=push(HQ,2);
HQ=push(HQ,3);
print(HQ);
HQ= pop(HQ);
print(HQ);


return 0;
}