L2-004 这是二叉搜索树吗？ (25 分)

优解：

#include <iostream>
#include <vector>
using namespace std;
struct BinTree
{
    int val;
    BinTree *left, *right;
};
BinTree* insert(BinTree *root, int v)
{
    if(root == nullptr)
    {
        root = new BinTree;
        root->val = v;
        root->left=root->right=nullptr;
    }
    else
    {
        if(root->val > v)
        {
            root->left = insert(root->left, v);
        }
        else
        {
            root->right = insert(root->right, v);
        }
    }
    return root;
}

vector<int> pre;
void pre_order(BinTree *root)
{
    if(root==nullptr)
        return ;
    pre.push_back(root->val);
    pre_order(root->left);
    pre_order(root->right);
}
vector<int> post;
void post_order(BinTree *root)
{
    if(root==nullptr)
        return ;
    post_order(root->left);
    post_order(root->right);
    post.push_back(root->val);
}
BinTree* mirror(BinTree *root)
{
    if(root==nullptr)
        return nullptr;
    root->left = mirror(root->left);
    root->right = mirror(root->right);
    BinTree *tmp = root->left;
    root->left = root->right;
    root->right = tmp;
    return root;
}

int main()
{
    int n;
    cin >> n;
    BinTree *root = nullptr;
    int v;
    vector<int> tin;
    for(int i=0;i<n;i++)
    {
        cin >> v;
        root = insert(root, v);
        tin.push_back(v);
    }
    pre_order(root);
    bool flag = true;
    for(int i=0;i<n;i++)
    {
        if(tin[i] != pre[i])
        {
            flag = false;
            break;
        }
    }
    if(flag)
    {
        cout << "YES" << endl;
        post_order(root);
        for(int i=0;i<n;i++)
        {
            if(i!=0)
                cout << " ";
            cout << post[i];
        }
        return 0;
    }
    root = mirror(root);
    pre.clear();
    pre_order(root);
    flag = true;
    for(int i=0;i<n;i++)
    {
        if(tin[i] != pre[i])
        {
            flag = false;
            break;
        }
    }
    if(flag)
    {
        cout << "YES" << endl;
        post_order(root);
        for(int i=0;i<n;i++)
        {
            if(i!=0)
                cout << " ";
            cout << post[i];
        }
        return 0;
    }
    cout << "NO" << endl;
    return 0;
}

自己未成功的方法//递归，在给定一个前序序列中找到一个比根节点大的，代表右子树的根节点，则左边的代表左节点，并保证右子树中所有的节点都不能比总root小，一直递归。

此方法目前只实现了判断是否是二叉树，待解决后序遍历

#include<iostream>
using namespace std;
int judge(int N,int*arr,int root,int *bac)//非mirror 
{
	if(N<=0)return 1;
	int mov=-1;
	int flag=1;
	int i=0;
	bac[N-1]=root;
//	cout<<"N-1="<<N-1<<endl;
	//cout<<"root="<<root<<endl;
	for(i=1;i<N;i++)
	{
		if(mov!=-1&&arr[i]<root)
		{
			flag=0;
		}
		if(arr[i]>=root&&mov==-1)
		{
			mov=i;
			cout<<arr[i]<<endl;
		//	bac[N-2]=arr[i];
		}
	}
	if(flag==0)return 0;
	else
	{
		if(judge(N-i-1,arr+i,arr[i],bac+i-1)*judge(i-1,arr+1,*(arr+1),bac+1)==1)return 1;
		else return 0;
	}
};
int mjudge(int N,int*arr,int root,int *bac)
{
	if(N<=1)return 1;
	int mov=-1;
	int flag=1;
	int i=0;
	bac[N-1]=root;
	for(i=1;i<N;i++)
	{
		if(mov!=-1&&arr[i]>=root)
		{
			flag=0;
		}
		if(arr[i]<root&&mov==-1)
		{
			mov=i;
		}
	}
	if(flag==0)return 0;
	else
	{
		 return mjudge(i-1,arr+1,*(arr+1),bac+1)*mjudge(N-i-1,arr+i,arr[i],bac+i);
	}
};
int main()
{
	int N;
	cin>>N;
	int arr[N];
	for(int i=0;i<N;i++)
	{
		cin>>arr[i];
	}
	int root=arr[0];
	int bac[N];
	int flag1=judge(N,arr,root,bac);
	if (flag1==1)
	{
		cout<<"YES"<<endl;
		for(int i=0;i<N;i++)
		{
			cout<<bac[i];
			if(i!=N-1)cout<<" ";
		}
		return 0;
	}
	else
	{
		int flag2=mjudge(N,arr,root,bac);
		if(flag2==1)
		{
			cout<<"YES"<<endl;		
		for(int i=0;i<N;i++)
		{
			cout<<bac[i];
			if(i!=N-1)cout<<" ";
		}
			return 0;
		}
		else
		{
			cout<<"NO";
			return 0;
		}
	}
return 0;}