栈的链式存储结构(带头结点的单链表实现)

#pragma once
#include<windows.h>
typedef struct Stacknode {
	Elemtype data;
	struct Stacknode *next;
}Stacktype;
//初始化
void InitStack(Stacktype **top) {
	*top = (Stacktype *)malloc(sizeof(Stacktype));
	(*top)->next = NULL;
}
//入栈操作
int pushStack(Stacktype *top, Elemtype x) {
	Stacktype *p;
	p = (Stacktype*)malloc(sizeof(Stacktype));//申请结点
	p->data = x;
	p->next = top->next;
	top->next = p;
	return true;
}
//出栈操作
Elemtype popStack(Stacktype *top) {
	Stacktype *p;
	Elemtype x;
	if (top->next == NULL) {
		printf("空栈!!");
		return NULL;
	}
	else {
		p = top->next;
		top->next = p->next;
		x = p->data;
		free(p);
		return x;
	}
}
//取栈顶数据元素
Elemtype GetTop(Stacktype *top) {
	if (top->next == NULL) {
		return NULL;
	}
	else {
		return (top->next->data);
	}
}

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
typedef int Elemtype;
#include"stack.h"
int main() {
	Stacktype *stack1;
	int x;
	InitStack(&stack1);
	printf("入栈的顺序为:");
	for (int i = 0; i < 10; i++) {
		printf("%d ", i + 1);
		pushStack(stack1, i + 1);
	}
	printf("\n出栈的顺序为:");
	while (stack1->next != NULL) {
		x = popStack(stack1);
		printf("%d ", x);
	}
	system("pause");
	return 0;
}