栈模拟迷宫

#include <stdio.h>
#include <stdlib.h>

#define STACK_SIZE 1
#define STACK_ADD 1
#define FLASE 0
#define TRUE 1
#define N 10
#define M 10

typedef int Elemtype;
typedef int Status;

int curstep = 1;  //探索的步数
int map[M][N];

typedef struct {
    int x;
    int y;
}PosType;  //坐标定义

typedef struct {
    int ord;   //通道块在路径上的“序号”
    PosType seat;   //通道块在迷宫中的“坐标位置”
    int di;  //从此通道块走向下一通道块的“方向”，上下左右
}SElemType;  //栈的元素类型

typedef struct {
    SElemType *base;  //栈的基地址
    SElemType *top;   //栈顶指针
    int stacksize;  //栈大小
}sql_stack;  //栈定义

sql_stack L;

Status InitStack(sql_stack &L)  //初始化栈
{
    L.base = (SElemType *)malloc(STACK_ADD * sizeof(SElemType));
    if (!L.base)
        exit(FLASE);
    L.top = L.base;
    L.stacksize = STACK_SIZE;
    return TRUE;
}

Status Push(sql_stack &L, SElemType e)  //入栈
{
    if (L.top - L.base >= L.stacksize)
    {
        L.base = (SElemType *)realloc(L.base,