二叉树广义表建树,层次遍历二叉树.doc

二叉树广义表建树，层次遍历二叉树 #include stdio.h #include stdlib.h #include malloc.h #define MAXSIZE 20 #define TRUE 1 #define FALSE 0 typedef struct BiTNode{ char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; typedef struct Queue{ BiTree treenode[MAXSIZE]; int front; int rear; }Queue; void Creatree(BiTree *,char *); /*广义表形式建树*/ void CountLeafNumbers(BiTree T,int *count); /*统计叶子节点的个数*/ int LevelOurput(BiTree ); /*层次遍历二叉树*/ void InitQueue(Queue *); int IsQueueEmpty(Queue *); int EnQueue(Queue *,BiTree T); int OutQueue(Queue *,BiTree *T); int main() { char *p; int i=0,count=0; BiTree T=NULL; p=(char *)malloc(sizeof(char)*MAXSIZE); printf(输入的字符间请以空格隔开(0结束):); for(i=0;iMAXSIZE;i++) { scanf(%c,(*(p+i))); if(*(p+i)==0) break; } Creatree(T,p); printf(\n层次遍历二叉树:); LevelOurput(T); /*层次遍历二叉树*/ printf(\n); CountLeafNumbers(T,count); printf(叶节点的个数为:%d\n,count); return 0; } void InitQueue(Queue *queue) /*队列初始化*/ { queue=(Queue *)malloc(sizeof(Queue)); queue-front=0; queue-rear=0; } int IsQueueEmpty(Queue *queue) { if(queue-front==queue-rear) return TRUE; else return FALSE; } int EnQueue(Queue *queue,BiTree T) { if(queue-rear=MAXSIZE) return FALSE; else { queue-rear=(queue-rear+1)%MAXSIZE; queue-treenode[queue-rear]=T; return TRUE; } return TRUE; } int OutQueue(Queue *queue,BiTree *T) { if(IsQueueEmpty(queue)) return FALSE; else { queue-front=(queue-front+1)%MAXSIZE; (*T)=queue-treenode[queue-front]; return TRUE; } return TRUE; } void Creatree(BiTree *b,char *str) { BiTree stack[MAXSIZE],p=NULL; char ch; int top=-1,k,j=0; *b=NULL; ch=str[j]; while(ch!=0) { switch(ch) { case (: /*为左节点*/ { top++; stack[top]=p; k=1; } break; case ): { top--; } break; case ,: /*为右节点*/ { k=2; } break; default: { p=(BiTree )malloc(sizeof(BiTNode)); p-data=ch; p-lchild=p-rchild=NULL; if(*b==NULL) *b=p; else { switch(k)