1.二叉树的建立 代码(以先序遍历输入) Status CreateBiTree(BiTree T){ scanf(&ch); //cin>>ch; if(ch == '#') T = NULL; else{ if(!(T = (BiTNode*)malloc(sizeof(BiTNode)))) exit(OVERFLOW);//T = new BiTNode; else{ t