//四叉树的前序,后序,层次遍历
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
using namespace std;
typedef char datatype;
typedef struct node //二叉树
{
datatype data;
struct node *lt,*rt,*lb,*rb;
} fourtnode, *fourtree;
typedef struct stack
{
fourtree data[100];
int tag[100];
int top;
} seqstack;
//队列的顺序结构
#define MAXQSIZE 100
typedef struct
{
fourtree * base;
int front;
int rear;
}SqQueue;
int InitQueue (SqQueue &Q)
{ //构造空队列
Q.base=(fourtree*)malloc (MAXQSIZE *sizeof(fourtree));//申请连续的存储空间
if (!Q.base) exit(0);
Q.front=Q.rear=0;//头、尾指针的初始化
return 1;
}
int EnQueue (SqQueue &Q,fourtree t)
{//入队
if ((Q.rear+1) % MAXQSIZE ==Q.front) return 0;//队满则返回出错信息<