树和二叉树的实验报告
}
ch=getchar(); if(ch=='\n') return Q; Q->s[0]=ch;
Q->rchild=Create_RTree(); return Q;
else if(ch ==')') {
}
if(len>0) { }
return NULL;
if((Q=(BiTNode*)malloc(sizeof(BiTNode)))==NULL)
return NULL;
memset(Q->s,0x00,sizeof(Q->s)); Q->lchild=NULL; Q->rchild=NULL; memcpy(Q->s,bt,len); len=0; return Q;
else if(ch =='+'||ch=='-'||ch =='*'||ch =='/'||ch =='^') {
if((T=(BiTNode*)malloc(sizeof(BiTNode)))==NULL)
return NULL; return NULL;
if((Q=(BiTNode*)malloc(sizeof(BiTNode)))==NULL) memset(Q->s,0x00,sizeof(Q->s)); memset(T->s,0x00,sizeof(T->s)); T->lchild=NULL; T->rchild=NULL; if(len==0) {
if(ch =='+'||ch =='-') {
// 只有+-号前面可以不是数字,此时左节点为空 T->s[0]=ch;
if((S=(BiTNode*)malloc(sizeof(BiTNode)))==NULL)
return NULL;
memset(S->s,0x00,sizeof(S->s)); S->lchild=NULL; S->rchild=NULL; p=S->s;