PAT甲级 1135

1135 Is It A Red-Black Tree （30 分）

There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:

• (1) Every node is either red or black.
• (2) The root is black.
• (3) Every leaf (NULL) is black.
• (4) If a node is red, then both its children are black.
• (5) For each node, all simple paths from the node to descendant leaves contain the same number of black nodes.

For example, the tree in Figure 1 is a red-black tree, while the ones in Figure 2 and 3 are not.

Figure 1	Figure 2	Figure 3

For each given binary search tree, you are supposed to tell if it is a legal red-black tree.

Input Specification:

Each input file contains several test cases. The first line gives a positive integer K (≤30) which is the total number of cases. For each case, the first line gives a positive integer N (≤30), the total number of nodes in the binary tree. The second line gives the preorder traversal sequence of the tree. While all the keys in a tree are positive integers, we use negative signs to represent red nodes. All the numbers in a line are separated by a space. The sample input cases correspond to the trees shown in Figure 1, 2 and 3.

Output Specification:

For each test case, print in a line "Yes" if the given tree is a red-black tree, or "No" if not.

Sample Input:

3
9
7 -2 1 5 -4 -11 8 14 -15
9
11 -2 1 -7 5 -4 8 14 -15
8
10 -7 5 -6 8 15 -11 17

Sample Output:

Yes
No
No

题意 ： 给出一组树的前序遍历序列，正数代表黑色结点，负数代表红色节点，判断它是否是红黑树，既满足以下要求：1）每一个节点或者是红的或者是黑的 2）根节点是黑色的 3）每个叶子节点（空的）是黑色的 4）如果节点是红色的，那么他的孩子节点是黑色的 5）对任一节点来说，从此节点到其后代叶子结 的简单路径包含同样数量的黑色结点

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
vector<int> arr;
struct node
{
    int data;
    struct node *left,*right;
};
//用链表建树
node* create(node *root,int v)
{
    if(root==NULL)
    {
        root=new node();
        root->data=v;
        root->left=root->right=NULL;

    }
    else if(abs(v)<=abs(root->data))
        root->left=create(root->left,v);
    else
        root->right=create(root->right,v);
    return root;

}
//判断红色节点的左右孩子是否是黑色的
bool judge1(node *root)
{
    if(root==NULL)
        return true;
    if(root->data<0)
    {
        if(root->left!=NULL&&root->left->data<0)
            return false;
        if(root->right!=NULL&&root->right->data<0)
            return false;
    }
    return judge1(root->left)&&judge1(root->right);

}
//记录结点左右子树的高度
int getSum(node *root)
{
    if(root==NULL)
        return 0;
    int l=getSum(root->left);
    int r=getSum(root->right);
//若开始遍历的结点是黑色的，则数量上要加1
    return root->data>0?max(l,r)+1:max(l,r);
}
//判断每个结点左右子树的高度是否相等
bool judge2(node *root)
{
    if(root==NULL)
        return true;
    int l=getSum(root->left);
    int r=getSum(root->right);
    if(l!=r)
        return false;
    return judge2(root->left)&&judge2(root->right);
}
int main()
{
    int n,k;
    cin>>k;
    for(int i=0; i<k; i++)
    {
        cin>>n;
        arr.resize(n);
        node *root=NULL;
        for(int j=0; j<n; j++)
        {
            cin>>arr[j];
            root=create(root,arr[j]);
        }
        if(arr[0]<0||judge1(root)==false||judge2(root)==false)
            cout<<"No"<<endl;
        else
            cout<<"Yes"<<endl;
    }
    return 0;
}