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, orNO
if not. Then if the answer isYES
, 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
当树是线性的,并且N==1000时,会出现段错误。
所以直接动态开辟内存。
分两次建树,镜像和非景象。
如果满足条件,输出后序遍历。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <stack>
#include <iomanip>
#include <cstdlib>
#include <queue>
#define MAXN 100003
using namespace std;
struct Node{
int val;
Node *left;
Node *right;
};
int a[1025];
int pos;
bool mark;
int n;
Node *insert1(Node *root,int index){
if(root == NULL){
root = (Node *)malloc(sizeof(Node));
root->val = a[index];
root->left = root->right = NULL;
return root;
}
else if(a[index] < root->val) root->left = insert1(root->left,index);
else root->right = insert1(root->right,index);
return root;
}
Node *Build1(Node *root){
int index = 0;
while(index < n){
root = insert1(root,index);
++index;
}
return root;
}
void pre1(Node *root){
if(root->val != a[pos++]){
mark = false;
}
if(root->left) pre1(root->left);
if(root->right) pre1(root->right);
}
void post1(Node *root){
if(root->left) post1(root->left);
if(root->right) post1(root->right);
if(pos++ == 0) cout << root->val;
else cout << ' ' << root->val;
}
Node *insert2(Node *root,int index){
if(root == NULL){
root = (Node *)malloc(sizeof(Node));
root->val = a[index];
root->left = root->right = NULL;
return root;
}
if(a[index] >= root->val) root->left = insert2(root->left,index);
else root->right = insert2(root->right,index);
return root;
}
Node *Build2(Node *root){
int index = 0;
while(index < n){
root = insert2(root,index);
++index;
}
return root;
}
void pre2(Node *root){
if(root->val != a[pos++]){
mark = false;
}
if(root->left) pre2(root->left);
if(root->right) pre2(root->right);
}
void post2(Node *root){
if(root->left) post2(root->left);
if(root->right) post2(root->right);
if(pos++ == 0) cout << root->val;
else cout << ' ' << root->val;
}
void dis(Node *root){
cout << root->val << ' ';
if(root->left) dis(root->left);
if(root->right) dis(root->right);
}
int main(){
cin >> n;
for(int i=0;i<n;++i) cin >> a[i];
Node *root1 = NULL;
root1 = Build1(root1);
// dis(root1);
// cout << endl;
pos = 0;
mark = true;
pre1(root1);
// cout << "pos is " << pos << endl;
if(mark){
cout << "YES" << endl;
pos = 0;
post1(root1);
cout << endl;
}
else{
Node *root2 = NULL;
root2 = Build2(root2);
pos = 0;
mark = true;
pre2(root2);
if(mark){
cout << "YES" << endl;
pos = 0;
post2(root2);
cout << endl;
}
else cout << "NO" << endl;
}
return 0;
}