leetcode 1609.奇偶树

1.题目要求:

如果一棵二叉树满足下述几个条件，则可以称为 奇偶树 ：

二叉树根节点所在层下标为 0 ，根的子节点所在层下标为 1 ，根的孙节点所在层下标为 2 ，依此类推。
偶数下标 层上的所有节点的值都是 奇 整数，从左到右按顺序 严格递增
奇数下标 层上的所有节点的值都是 偶 整数，从左到右按顺序 严格递减
给你二叉树的根节点，如果二叉树为 奇偶树 ，则返回 true ，否则返回 false 。

2.全部代码:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 //创建队列
typedef struct queue{
    struct TreeNode* data;
    struct queue* next;
}queue_t;
//入队
void push(queue_t** head,struct TreeNode* data){
    queue_t* newnode = (queue_t*)malloc(sizeof(queue_t));
    newnode->data = data;
    newnode->next = NULL;
    if(*head == NULL){
        *head = newnode;
        return;
    }
    queue_t* tail = *head;
    while(tail->next != NULL){
        tail = tail->next;
    }
    tail->next = newnode;
}
//出队
struct TreeNode* pop(queue_t** head){
    struct TreeNode* x = (*head)->data;
    (*head) = (*head)->next;
    return x;
    
}
//判断偶数层
bool even_judge(int* oddnumber,int length){
    int i = 0;
    for(i = 0;i < length - 1;i++){
        if(oddnumber[i] >= oddnumber[i + 1]){
            return false;
        }
        if(oddnumber[i] % 2 == 0){
            return false;
        }
    }
    if(oddnumber[length - 1] % 2 == 0){
        return false;
    }
    return true;
}
//判断奇数层
bool odd_judge(int* evennumber,int length){
    int i = 0;
    for(i = 0;i < length - 1;i++){
        if(evennumber[i] <= evennumber[i + 1]){
            return false;
        }
        if(evennumber[i] % 2 != 0){
            
            return false;
        }
    }
    if(evennumber[length - 1] % 2 != 0){
        printf("1\n");
        return false;
    }
    return true;
}
bool isEvenOddTree(struct TreeNode* root) {
    int count = 1;
    int nextcount = 0;
    int depth = 0;
    queue_t* enquence = NULL;
    int size = 0; 
    int* number = (int*)malloc(sizeof(int) * 100000);//设置层序遍历数组
    int j = 0;
    int* one_line_count = (int*)malloc(sizeof(int) * 100000);//存入每层的结点数
    int j_1 = 0;
    push(&enquence,root);
    size++;
    //开始层序遍历
    while(size != 0){
        depth++;
        for(int i = 0;i < count;i++){
            struct TreeNode* temp = pop(&enquence);
            number[j] = temp->val;
            j++;
            size--;
            if(temp->left != NULL){
                push(&enquence,temp->left);
                nextcount++;
                size++;
            }
            if(temp->right != NULL){
                push(&enquence,temp->right);
                nextcount++;
                size++;
            } 
        }
        one_line_count[j_1] = count;
        j_1++;
        count = nextcount;
        nextcount = 0;;
    }
    //创立二维数组
    int** node = (int**)malloc(sizeof(int*) * j_1);
    for(int i = 0;i < j_1;i++){
        node[i] = (int*)malloc(sizeof(int) * one_line_count[i]);
    }
    int f = 0;
    //往里面存入值
    for(int i = 0;i < j_1;i++)
    {
        for(int j = 0;j < one_line_count[i];j++){
            node[i][j] = number[f];
            f++;
        }
    }
    //判断二位数组的每行元素
    for(int i = 0;i < j_1;i++){
        if(i % 2 == 0){
            bool ret = even_judge(node[i],one_line_count[i]);
            if(ret == false){
                return false;
            }
        }else{
            bool ret = odd_judge(node[i],one_line_count[i]);
            if(ret == false){
                return false;
            }
        }
    }
    return true;
}