关闭

1043. Is It a Binary Search Tree (25)

标签: 数据结构浙大二叉树算法
109人阅读 评论(0) 收藏 举报
分类:

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;
}



0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:30350次
    • 积分:1169
    • 等级:
    • 排名:千里之外
    • 原创:90篇
    • 转载:1篇
    • 译文:0篇
    • 评论:2条