1135 Is It A Red-Black Tree (30 分)

1135 Is It A Red-Black Tree (30 分)

解题思想

AC代码

#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
vector<int> arr;
struct node{
    int val;
    struct node *left, *right;
};
node* build(node *root, int v){
    if (root == NULL){
        root = new node();
        root->val = v;
        root->left = root->right = NULL;
    }
    else if (abs(v) <= abs(root->val))
        root->left = build(root->left, v);
    else root->right = build(root->right, v);
    return root;
}
bool judge1(node *root){
    if (root == NULL) return true;
    if (root->val < 0){
        if (root->left != NULL && root->left->val < 0) return false;
        if (root->right != NULL && root->right->val < 0) return false;
    }
    return judge1(root->left) && judge1(root->right);
}
int getNum(node *root){
    if (root == NULL) return 0;
    int l = getNum(root->left);
    int r = getNum(root->right);
    return root->val>0 ? max(l, r)+1 : max(l, r);
}
bool judge2(node *root){
    if (root == NULL) return true;
    int l = getNum(root->left);
    int r = getNum(root->right);
    if (l != r) return false;
    return judge2(root->left) && judge2(root->right);
}
int main(){
    int k, n;
    scanf("%d", &k);
    for (int i = 0; i < k; i++){
        scanf("%d", &n);
        arr.resize(n);
        node *root = NULL;
        for (int j = 0; j < n; j++){
            scanf("%d", &arr[j]);
            root = build(root, arr[j]);
        }
        if (arr[0]<0 || judge1(root)==false || judge2(root)==false)
            printf("No\n");
        else printf("Yes\n");
    }
    return 0;
}