树和二叉树的实验报告
}
} else
{ }
T->rchild=S;
ch=getchar();
if(ch=='+'||ch =='-'||ch =='*'||ch =='/'||ch=='^')
break; *p++=ch;
return NULL;
else { }
BiTNode *Create_RootTree() {
BiTree Q,T;
while((ch=getchar())!= EOF) {
if (ch=='\n') { }
return NULL;
}
return NULL;
}
Q->lchild=T; Q->s[0]=ch;
if((Q->rchild = Create_RTree()) == NULL) else
return Q; return NULL; //堆栈中为左节点值 memcpy(T->s,bt,len); len =0;
} else
push(ch);
else if(ch==':') //构造根节点：= {
ch=getchar();
if(ch!='=') return NULL;
if((Q=(BiTNode*)malloc(sizeof(BiTNode)))==NULL)