1032.Is It a Binary Search Tree (25) PAT甲级刷题

题目描述

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.

输入描述:

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.

输出描述:

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.

输入例子:

7
8 6 5 7 10 8 11

输出例子:

YES
5 7 6 8 11 10 8

思路：先根据输入序列判是不是bst，不是就输出no结束，否则建树。这里判树和建树的代码相似度略高，有没有大佬可以看看能不能合并一下。。。

#include <iostream>
using namespace std;

struct TNode{
    int v;
    int left,right;
};

bool judge(TNode tree[],int l,int r,bool flag){
    if(l==r)
        return 1;
    int i=l+1;
    if(!flag)
        while(tree[i].v<tree[l].v&&i<=r) ++i;   //找左右子树划分点
    else
        while(tree[i].v>=tree[l].v&&i<=r) ++i;
    if(i==r+1){                                 //右子树空
        for(int j=l+1;j<=r;++j){
            if(!flag&&tree[j].v>=tree[l].v)
                return 0;
            else if(flag&&tree[j].v<tree[l].v)
                return 0;
        }
        return judge(tree,l+1,r,flag);
    }
    else if(i==l+1){                          //左子树空
        for(int j=l+1;j<=r;++j){
            if(!flag&&tree[j].v<tree[l].v)
                return 0;
            else if(flag&&tree[j].v>=tree[l].v)
                return 0;
        }
        return judge(tree,l+1,r,flag);
    }
    else{
        for(int j=l+1;j<=i-1;++j){
            if(!flag&&tree[j].v>=tree[l].v)
                return 0;
            else if(flag&&tree[j].v<tree[l].v)
                return 0;
        }
        for(int j=i;j<=r;++j){
            if(!flag&&tree[j].v<tree[l].v)
                return 0;
            else if(flag&&tree[j].v>=tree[l].v)
                return 0;
        }
        return judge(tree,l+1,i-1,flag)&&judge(tree,i,r,flag);
    }
}

void build(TNode tree[],int l,int r){
    if(l==r){
        tree[l].left = -1;
        tree[l].right = -1;
        return;
    }
    int i=l+1;
    if(tree[l].v>tree[i].v)
        while(tree[i].v<tree[l].v&&i<=r) ++i;
    else
        while(tree[i].v>=tree[l].v&&i<=r) ++i;
    if(i==r+1){
        tree[l].left = l+1;
        tree[l].right = -1;
        build(tree,l+1,r);
    }
    else if(i==l+1){
        tree[l].left = -1;
        tree[l].right = l+1;
        build(tree,l+1,r);
    }
    else{
        tree[l].left = l+1;
        tree[l].right = i;
        build(tree,l+1,i-1);
        build(tree,i,r);
    }
}

void post(TNode tree[],int root){
    static int cnt = 0;
    if(tree[root].left!=-1)
        post(tree,tree[root].left);
    if(tree[root].right!=-1)
        post(tree,tree[root].right);
    if(cnt!=0)
        cout<<' ';
    cout<<tree[root].v;
    ++cnt;
}

int main()
{
    int n;
    cin>>n;
    TNode tree[1001];
    for(int i=0;i<n;++i)
        cin>>tree[i].v;
    bool flag = 0;
    if(n>1&&tree[0].v<=tree[1].v)
        flag = 1;
    if(!judge(tree,0,n-1,flag)){
        cout<<"NO";
        return 0;
    }
    cout<<"YES"<<endl;
    build(tree,0,n-1);
    post(tree,0);
    return 0;
}