DLU-1031 旋转吧！葱！

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#define MAX 1500
 
struct TreeNode
{
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
};
 
typedef struct seqqueue
{
    struct TreeNode* data[MAX];
    int front;
    int rear;
} seqqueue;
 
void enter(seqqueue *q,struct TreeNode* t)
{
    q->data[q->rear] = t;
    q->rear++;
}
 
struct TreeNode* del(seqqueue *q)
{
    if(q->front == q->rear)
    {
        return NULL;
    }
    else
    {
        q->front++;
        return q->data[q->front-1];
    }
}
 
void level_tree(struct TreeNode* t)
{
    seqqueue q;
    struct TreeNode* temp;
    q.front = q.rear = 0;
    if(!t)
    {
        return ;
    }
    enter(&q,t);
    while(q.front != q.rear)
    {
        t=del(&q);
        printf("%d ",t->val);
        if(t->left)
        {
            enter(&q,t->left);
        }
        if(t->right)
        {
            enter(&q,t->right);
        }
    }
}
 
void exchange(struct TreeNode *root)
{
    struct TreeNode *node = root;
    if(node != NULL)
    {
        struct TreeNode *temp = node -> left;
        node -> left = node -> right;
        node -> right = temp;
    }
}
 
struct TreeNode* invertTree(struct TreeNode* root)
{
    struct TreeNode *node = root;
    if(root == NULL)
    {
        return root;
    }
    invertTree(node->left);
    invertTree(node->right);
    exchange(node);
    return root;
}
 
int main()
{
    int node_num;
    while(~scanf("%d",&node_num))
    {
        struct TreeNode *node[node_num];
        int i;
        for(i = 0; i < node_num; i ++)
        {
            node[i] = malloc(sizeof(struct TreeNode));
            scanf("%d",&node[i]->val);
            if(node[i]->val==-1)
            {
                node[i] = NULL;
                continue;
            }
            node[i] -> left = NULL;
            node[i] -> right = NULL;
        }
        for(i = node_num-1; i > 0; i --)
        {
            if(i & 0x1)
            {
                node[i/2]->left = node[i];
            }
            else
            {
                node[i/2-1]->right = node[i];
            }
        }
        struct TreeNode *root = invertTree(node[0]);
        level_tree(root);
        printf("
");
    }
    return 0;
}