编程实现栈的入栈与出栈操作

#include <tchar.h>
#include <iostream>
using namespace std;

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

typedef struct linkmyqueue{
	node *below;
	node *top;
} myqueue;

node* create()
{
	node *head, *p, *s;
	int x, cycle = 1;
	head = (node *)malloc(sizeof(node));
	p = head;
	while(cycle)
	{
		cout << "please input the data: ";
		cin >> x;
		cout << endl;
		if( x != 0)
		{
			s = (node *)malloc(sizeof(node));
			s->data = x;
			p->next = s;
			p = s;
		}
		else
		{
			cycle = 0;
		}
		
	}
	p->next = NULL;
	head = head->next;
	return head;
}


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

void print(node *head)
{
	int n;
	node *p;
	p = head;
	n = length(head);
	cout << "There is " << n << " data in list\n" << endl;
	while(p != NULL)
	{
		cout << p->data << " -> ";
		p = p->next;
	}
	cout << endl;
}

node *last(node *head)
{
	node *p;
	p = head;
	while(p->next != NULL)
		p = p->next;
	return p;
}

myqueue *push(myqueue *LQ, int x)
{
	node *p;
	p = (node *)malloc(sizeof(node));
	p->data = x;
	p->next = NULL;
	if(LQ->below == NULL)
	{
		LQ->below = p;
		LQ->top = p;
	}
	else
	{
		LQ->top->next = p;
		LQ->top = p;
	}
	return LQ;
}

myqueue *pop(myqueue * LQ)
{
	node *p, *q;
	if(LQ->below == NULL)
	{
		cout<<"the queue is overflow!"<<endl;
		return LQ;
	}
	p = LQ->below;
	if(LQ->below == LQ->top)
	{
		LQ->below = NULL;
		LQ->top = NULL;
		free(p);
	}
	else
	{
		q = LQ->top;
		while(p->next != LQ->top)
		{
			p = p->next;
		}
		LQ->top = p;
		LQ->top->next = NULL;
		free(q);
	}
	return LQ;
}


int _tmain(int argc, _TCHAR * argv[])
{
	node *head, *end;
	myqueue *LQ;
	head = create();
	end = last(head);//获取尾节点指针
	print(head);
	LQ = (myqueue *)malloc(sizeof(myqueue));//给栈分配内存空间
    LQ->below = head;
	LQ->top = end;
	for (int i=1; i<=4; i++)
	{
		LQ = push(LQ, i);
	}
	print(head);
	for (i=1; i<=2; i++)
	{
		LQ = pop(LQ);
	}
	print(LQ->below);
	return 0;
}