JSMS16-层序遍历二叉树

层序遍历二叉树

    tree *layer(tree* t)
    {
        tree *ret=t;
        tree *queue[MAXSIZE];
        tree *tmp;
        int front=0;
        int rear=0;
        if(t!=NULL)
        {
            queue[rear++]=t;
        }
        while(front!=rear)
        {
            tmp=queue[front++];
            printf("%d->",tmp->data);
            if(tmp->left!=NULL)
            {
                queue[rear++]=tmp->left;
            }
            if(tmp->right!=NULL)
            {
                queue[rear++]=tmp->right;
            }
        }
    
    }