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

// DataStructure.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include "stdlib.h"
#include <ctime>

typedef struct Student
{
	int data;
	Student*next;
}Node;

typedef struct
{
	Node *base;
	Node *top;
}Stack;

Stack *create(int *data,int length){
	if (data==NULL||length<1)
	{
		return NULL;
	}

	Stack *stack=new Stack();
	stack->base=NULL;
	stack->top=NULL;
	for (int i = 0; i < length; i++)
	{
		Node* node=new Node();
		node->data=data[i];
		node->next=NULL;

		if (stack->base==NULL)
		{
			stack->base=node;
		}
		else
		{
			stack->top->next=node;
		}
		stack->top=node;
	}

	return stack;
}

Node *pop(Stack *stack){
	if (stack==NULL||stack->top==NULL)
	{
		return NULL;
	}

	Stack *s=stack;
	Node *p=s->base;
	while (p!=NULL&&p->next!=NULL&&p->next!=s->top)//寻找倒数第二个结点
	{