#include<stdio.h>
#include<malloc.h>
#include<iostream>
#include<stack>
#include<queue>
using namespace std;

typedef struct BiTNode
{
    char data,tag;
    struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

int createBiTree(BiTree &T)//create tree by pre order
{
    char data;
    scanf("%c",&data);
    if(data=http://www.mamicode.com/='#')>
二叉树的遍历（递归与非递归）