二叉树模版变形
#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<queue>
using namespace std;
typedef struct BiTNode{
char data;
struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;
int z=0; //***
int CreateBiTree(BiTree &T,char *m)
{
char data;
data=*(m+z);
z++; //***
if(data=='#')
T=NULL;
else
{
T=(BiTree)malloc(sizeof(BiTNode));
T->data=data;
CreateBiTree(T->lchild,m); //*
CreateBiTree(T->rchild,m);
}
return 0;
}
void Visit(BiTree T)
{
if(T->data!='#')