数据结构之树和二叉树(.ppt

status CreateBiTree(BiTree &T) { scanf&ch; if (ch== ) T = NULL; else { if (T = (BiTree)malloc(sizeof(BiTNode) exit(OVERFLOW; T->data = ch; // 生成根结点 CreateBiTree(T->lchild; // 构造左子树 CreateBiTree(T->rc