二叉树的层次遍历 数组版

白书 上的解法真是各种不明觉厉，只好去求教硕神，哎，差距真大，好好学习吧，任重道远

#include<stdio.h>#include<string.h>#include<stdlib.h>const int MAXN=300;struct Node{int left,right;int vis;int val;}tree[MAXN];char s[MAXN];int cnt,ans[MAXN],next,root;int newnode(){tree[next].vis=tree[next].left=tree[next].right=0;return next++;}void  addnode(int val,char *s)                  //表示树中添加结点{int len=strlen(s);int u=0;                        //从根结点向下走for(int i=0;i<len;i++){if(s[i]=='L'){if(tree[u].left==0){tree[u].left=newnode();}u=tree[u].left;}else if(s[i]=='R'){if(tree[u].right==0){tree[u].right=newnode();}u=tree[u].right;}}tree[u].val=val;    tree[u].vis=1;}int readin()                            //输入部分{next=0;                             //next为结点的位置root=newnode();for(;;){if(scanf("%s",s)!=1) return 0;if(!strcmp(s,"()")) break;int val;sscanf(&s[1],"%d",&val);addnode(val,strchr(s,',')+1);}return true;}int bfs()                       //遍历二叉树{int front=0,rear=1;int q[MAXN];q[0]=root;while(front<rear){int u=q[front++];if(!(tree[u].vis))return 0;ans[cnt++]=tree[u].val;if(tree[u].left)q[rear++]=tree[u].left;if(tree[u].right)q[rear++]=tree[u].right;}return true;}int main(){    while(readin()) {        cnt = 0;        if(bfs()) {            for(int i = 0; i < cnt-1; i++)                printf("%d ", ans[i]);            printf("%d\n", ans[cnt-1]);        }        elseputs("-1");    }return 0;}