二叉树层次遍历.rar

#include <stdio.h> #include <stdlib.h> #include <conio.h> #define MS 50 struct BTreeNode { char date; struct BTreeNode *lchild; struct BTreeNode *rchild; }; typedef struct BTreeNode TNODE; TNODE *creat(int n) { int i,j; char x; TNODE *narr[100],*p,*t; for(j=1;j<=n;j++) { printf("input i,x:\n"); scanf("%d,%c",&i,&x); p=(TNODE*)malloc(sizeof(TNODE)); p->date=x; p->lchild=NULL; p->rchild=NULL; narr[i]=p; if(i==1) t=p; else { if(i%2==0) narr[i/2]->lchild=p; else narr[i/2]->rchild=p; } } return(t); } void Inorder(struct BTreeNode *BT) { if(BT!=NULL) { Inorder(BT->lchild); printf("%5c", BT->date); Inorder(BT->rchild); } } void levelerder(struct BTreeNode *BT ) { struct BTreeNode *q[MS]; int front=0,rear=0; if(BT!=NULL) { rear=(rear+1)%MS; q[rear]=BT; } while(front!=rear) { struct BTreeNode *p; front=(front+1)%MS; p=q[front]; printf("%5c",p->date); if(p->lchild!=NULL) { rear=(rear+1)%MS; q[rear]=p->lchild; } if(p->rchild!=NULL) { rear=(rear+1)%MS; q[rear]=p->rchild; } } } void main() { TNODE *t; int a; printf("input the number of BTreeNode\n"); scanf("%d",&a); t=creat(a); Inorder(t); levelerder(t); }