摘要： 将头结点 左右子树依次进入队列最后从队头依次出队#include#includetypedef struct BitNode{ char data; struct BitNode *lchild,*rchild;} *BiTree;int CreateBiTree(BiTree &T){char ch;//char ch1; ch =getchar(); //ch =ch1; if(ch == '#' ) T =NULL; else { if(!(T = (BitNode*)malloc(sizeof(BitNode)))) exit(0); T->data = 阅读全文