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
评价:此题我用静态链表做,最后两个case一直都过不了,改用指针了,其实还是挺好用的
没什么难点,就根据题意去检测合法性即可。
代码
#include<iostream>
#include<cstdio>
#include<vector>
#include<stack>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int n;
struct node
{
int data;
node* l;
node* r;
};
void insert(node* &root,int x)
{
if(root==NULL)
{
root=new node;
root->data=x;
root->r=root->l=NULL;
return;
}
if(abs(x)<abs(root->data))
insert(root->l,x);
else
insert(root->r,x);
}
int dfs1(node* root)
{
if(root==NULL)
return 0;
int left=dfs1(root->l);
int right=dfs1(root->r);
if(left==-1||right==-1||left!=right)
return -1;
int now=left;
if(root->data>0)
now++;
return now;
}
bool dfs2(node *root)
{
if(root==NULL)
return true;
if(root->data<0)
{
if(root->l!=NULL&&root->l->data<0)
return false;
if(root->r!=NULL&&root->r->data<0)
return false;
}
return dfs2(root->l)&&dfs2(root->r);
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n;
node *root=NULL;
int x;
for(int i=0;i<n;i++)
{
cin>>x;
insert(root,x);
}
if(root->data<0)
cout<<"No"<<endl;
else
if(dfs1(root)==-1)
cout<<"No"<<endl;
else
if(!dfs2(root))
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
return 0;
}