树和二叉树的实验报告
typedef struct BiNode {
char ch,bt[1024]; int len=0;
void push(char c) { }
BiTree Create_RTree() {
BiTree T,Q,S; char *p; while(ch!=EOF) {
ch=getchar(); if(ch=='\n') { }
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;
if (len<1024)
bt[len++] = c; char s[20];
struct BiNode *lchild,*rchild;
}BiTNode,*BiTree;
else if (ch == '(') {
if((Q=(BiTNode*)malloc(sizeof(BiTNode)))==NULL)
return NULL;
memset(Q->s,0x00,sizeof(Q->s)); Q->rchild = NULL;