<span style="font-size:18px;"><span style="font-size:18px;">#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define PF printf("\n")
int m,n,max;
typedef struct BiTNode
{
int data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;//定义二叉树
//创建二叉树 (按照前序顺序输入)
void CreateBiTree(BiTree &T)
{
int temp;
scanf("%d",&temp);
if(temp==-1)
T=NULL;
else
{
T=new BiTNode;
T->data=temp;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
}
//二叉树遍历,先序遍历
void PreOrderTraverse(BiTree &T)
{