1043. Is It a Binary Search Tree (25)
2016-02-02 16:17
369 查看
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:
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
有些单词需要熟悉一下,先序遍历: preorder,后序遍历 postorder,中序遍历 inorder,二叉搜索树:Binary Search Tree (BST),
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
有些单词需要熟悉一下,先序遍历: preorder,后序遍历 postorder,中序遍历 inorder,二叉搜索树:Binary Search Tree (BST),
#include<iostream> #include<algorithm> using namespace std; int a[1005],b[1005]; typedef struct node{ int date; node *lchild; node *rchild; node(){ lchild=NULL,rchild=NULL; } }*tree; void insert(tree &t,int date){ if(t==NULL){ t=new node; t->date=date; } else if(date<t->date){ insert(t->lchild,date); } else{ insert(t->rchild,date); } } tree change(tree t){ if(t->lchild||t->rchild) { tree temp=t->lchild; t->lchild=t->rchild; t->rchild=temp; if(t->lchild) t->lchild=change(t->lchild); if(t->rchild) t->rchild=change(t->rchild); } return t; } int k=-1; bool preorder(tree t){ if(t){ k++; if(t->date==a[k]) { return preorder(t->lchild)&&preorder(t->rchild); } else return false; } return true; } int pk; void postorder(tree t,int n){ if(t){ postorder(t->lchild,n); postorder(t->rchild,n); pk++; if(pk==n) printf("%d",t->date); else printf("%d ",t->date); } } int main(){ freopen("in.txt","r",stdin); int n; while(scanf("%d",&n)!=EOF){ tree t=NULL; for(int i=0;i<n;i++){ scanf("%d",&a[i]); b[i]=a[i]; insert(t,a[i]); } if(preorder(t)){ pk=0; printf("YES\n"); postorder(t,n); } else { change(t); k=-1; if(preorder(t)){ pk=0; printf("YES\n"); postorder(t,n); } else printf("NO\n"); } } return 0; }
相关文章推荐
- 1.4
- 指向vector的指针及空间释放问题 http://bbs.csdn.net/topics/320050082
- 18.Argument replacement
- 右划返回Activity
- Android推送通知
- Swift 引用计数总结 Strong,Weak, unowned 简单使用
- mysql几种性能测试的工具使用
- C# Windows Service调用IBM Lotus Notes发送邮件
- android 9patch图片的绘制
- hdoj--5093--Battle ships(二分图经典建图)
- 1.3.3 执行命令
- 游戏中的有限状态机
- phpexcel
- 1.3.2 配置SQL*Plus环境
- 1.3.1 连接到数据库
- android广告栏banner封装
- android中解决内存泄露问题
- boost 常用替换和转换
- Eclipse导入git上的maven web项目 部署
- const