以递归的方法先序创建二叉树,结点的值为字符型,’#’字符表示空树
Status CreateBiTree(BiTree &T) { char ch; scanf("%c",&ch); if (ch=='#') T = NULL; else { if (!(T = (BiTNode *)malloc(sizeof(BiTNode)))) return ERROR; 1 2 3 } return OK; }
T->data = ch;
CreateBiTree(T->left);
CreateBiTree(T->right);