A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
The left subtree of a node contains only nodes with keys less than the node’s key.
The right subtree of a node contains only nodes with keys greater than or equal to the node’s key.
Both the left and right subtrees must also be binary search trees.
If we swap the left and right subtrees of every node, then the resulting tree is called the Mirror Image of a BST.
Now given a sequence of integer keys, you are supposed to tell if it is the preorder traversal sequence of a BST or the mirror image of a BST.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤1000). Then N integer keys are given in the next line. All the numbers in a line are separated by a space.
Output Specification:
For each test case, first print in a line YES if the sequence is the preorder traversal sequence of a BST or the mirror image of a BST, or NO if not. Then if the answer is YES, print in the next line the postorder traversal sequence of that tree. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.
Sample Input 1:
7
8 6 5 7 10 8 11
Sample Output 1:
YES
5 7 6 8 11 10 8
Sample Input 2:
7
8 10 11 8 6 7 5
Sample Output 2:
YES
11 8 10 7 5 6 8
Sample Input 3:
7
8 6 8 5 10 9 11
Sample Output 3:
NO
解题思路
忘记了BST的性质,以为只要是头结点的左孩子小于头结点,右孩子大于头结点就可以了。其实是其头结点的左子树上所有数都要小于头结点,头结点的右子树上所有数都大于头结点。就因为这个性质搞错导致改来改去就得了17分,特写此题解警示自己。
#include<bits/stdc++.h>
using namespace std;
int n,a[1001];
int isMirror,isBST;
queue<int>q;
void dfs(int l,int r){
if(l>r||!isBST)
return;
if(l==r){
q.push(a[l]);
return;
}
int k=r+1;
//当不是镜像时,找到第一个大于头接点的数,这个数就是右子树的头结点
//当是镜像时,找到第一个小于头接点的数,这个数就是右子树的头结点
for(int i=l+1;i<=r;i++){
if(a[i]<a[l]&&!isMirror) continue;
if(a[i]>=a[l]&&isMirror) continue;
k=i;
break;
}
//当不是镜像时,如果右子树出现了大于头结点的数,那就不是二叉树
//当是镜像时,如果右子树出现了小于头结点的数,那就不是镜像二叉树
for(int i=k;i<=r;i++){
if(a[i]<a[l]&&!isMirror) isBST=0;
if(a[i]>=a[l]&&isMirror) isBST=0;
}
if(!isBST)
return;
//后序遍历
dfs(l+1,k-1);//左
dfs(k,r);//右
q.push(a[l]);//中
}
int main()
{
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
}
isMirror=a[1]>a[2]?0:1;
isBST=1;
dfs(1,n);
if(isBST){
cout << "YES\n";
cout <<q.front();
q.pop();
while(!q.empty()){
cout <<" "<<q.front();
q.pop();
}
}
else
cout << "NO";
}