1043. Is It a Binary Search Tree (25)

原创 2016年08月30日 22:59:42

1043. Is It a Binary Search Tree (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

提交代

#include<cstdio>
#include <vector>
using namespace std;
 struct node{
  int data;
  node*left;
  node*right;
 };
//新建二叉树
  void insert (node*&root,int data)
  {


     if(root==NULL)
{
root=new node;
root->data=data;
        root->left=root->right=NULL;
return;
}
if(data<root->data)
{
insert(root->left,data);
}else{
insert(root->right,data);
}
  } 
 void preorder(node*root,vector<int>&vi)
 {
  if(root==NULL)
  {
  return;

    vi.push_back(root->data);
    preorder(root->left,vi);
preorder(root->right,vi);  
 } 
 void preordermirror(node*root,vector<int>&vi)
 {
  if(root==NULL)
    {
  return;
}
    vi.push_back(root->data); 
preordermirror(root->right,vi);
preordermirror(root->left,vi);
 } 
 void  postorder(node*root,vector<int>&vi)
 {
    if(root==NULL)
{
return;
}
postorder(root->left,vi);
postorder(root->right,vi);
vi.push_back(root->data);
 }


 void postordermirror(node*root,vector<int>&vi)
 {
    if(root==NULL)
{
return;
    }
    postordermirror(root->right,vi);
postordermirror(root->left,vi);
vi.push_back(root->data);
 }
 
vector<int>origin,pre,prem,post,postm;
int main()
{
   int n,data,i;
   //定义头结点
   node*root=NULL; 
   scanf("%d",&n);
   for(i=0;i<n;i++)
   {
     scanf("%d",&data);
      origin.push_back(data);
      insert(root,data);
   }
   //求先序
   preorder(root,pre);    
   //求镜像树先序
   preordermirror(root,prem);    
   //求后序
   postorder(root,post);   
   //求镜像后序 
   postordermirror(root,postm);
   if(origin==pre)
   {
      printf("YES\n"); 
 for(i=0;i<post.size();i++)
 {
  printf("%d",post[i]);
  if(i<post.size()-1)
  {
       printf(" ");  
}
 }
   
} else if(origin==prem)
{
printf("YES\n");
for(i=0;i<postm.size();i++)
{
      printf("%d",postm[i]);
    if(i<postm.size()-1)
  {
       printf(" ");  
}
 }
}else{
       printf("NO\n"); 
}
return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

PAT 1043. Is It a Binary Search Tree (25)

http://pat.zju.edu.cn/contests/pat-a-practise/1043
  • xtzmm1215
  • xtzmm1215
  • 2014年08月18日 00:14
  • 1804

1043. Is It a Binary Search Tree (25) -- 二搜索叉树构建 和 递归遍历

1043. Is It a Binary Search Tree (25) A Binary Search Tree (BST) is recursively defined as a bina...
  • qq_26437925
  • qq_26437925
  • 2015年10月22日 10:23
  • 397

1043. Is It a Binary Search Tree (25)【二叉树】——PAT (Advanced Level) Practise

题目信息1043. Is It a Binary Search Tree (25)时间限制400 ms 内存限制65536 kB 代码长度限制16000 BA Binary Search Tree...
  • xianyun2009
  • xianyun2009
  • 2015年12月06日 00:21
  • 1729

浙大 PAT 1043. Is It a Binary Search Tree (25)

1043. Is It a Binary Search Tree (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限...
  • IAccepted
  • IAccepted
  • 2014年03月05日 13:23
  • 2815

PAT 1043. Is It a Binary Search Tree

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1043 题解: 1:通过输入构造二叉排序树 2:先序遍历并与输入顺序比较 3:如果比较不符合再构造镜...
  • ACM_Ted
  • ACM_Ted
  • 2014年03月07日 16:01
  • 789

235. Lowest Common Ancestor of a Binary Search Tree [easy] (Python)

题目链接https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/题目原文 Given a bina...
  • coder_orz
  • coder_orz
  • 2016年05月25日 15:26
  • 893

leetcode 669. Trim a Binary Search Tree

Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that ...
  • huanghanqian
  • huanghanqian
  • 2017年09月04日 17:13
  • 1312

Trim a Binary Search Tree问题及解法

669. Trim a Binary Search Tree LeetCode
  • u011809767
  • u011809767
  • 2017年09月05日 11:55
  • 705

【LeetCode】669 Trim a Binary Search Tree

原题地址:669. Trim a Binary Search Tree。题意给定一棵二叉搜索树和最小最大边界L和R,修剪这棵树,使得其中的元素位于L和R之间。解法 当root的值位于L和R之间,则递归...
  • hlljjy123
  • hlljjy123
  • 2017年09月08日 15:53
  • 1280

【PAT】1066. Root of AVL Tree (25)

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1066 题目描述: An AVL tree is a self-balancing ...
  • realxuejin
  • realxuejin
  • 2013年10月19日 16:16
  • 1852
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1043. Is It a Binary Search Tree (25)
举报原因:
原因补充:

(最多只允许输入30个字)