数据结构实验-括号匹配的检验-链栈实现

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;

typedef struct LinkNode{
   
	char data;
	struct LinkNode * next;
}LinkNode,*LiStack;

int InitStack(LiStack &L)//初始化栈
{
   
	L = NULL;
	return 1;
}

int Push(LiStack &L,char x)//入栈
{
   
	LinkNode *s;
	//char x;
	s = (LiStack)malloc(sizeof(LinkNode));
	s->data = x;
	s->next = L;
	L = s;
	return 1;
}

int Pop(LiStack &L, char &x)//出栈
{
   
	if (L != NULL) {
   
		LinkNode *p;
		p = L;
		x = p->data;
		L = L->next;
		free(p);
		return 1;
	}
	else
		return 0;
}

int GetTop(LiStack L)//取栈顶元素
{
   
	if (L == NULL