PAT 1043. Is It a Binary Search Tree (25)
来源:互联网 发布:手机淘宝图片不清晰 编辑:程序博客网 时间:2024/05/28 15:35
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:78 6 5 7 10 8 11Sample Output 1:
YES5 7 6 8 11 10 8Sample Input 2:
78 10 11 8 6 7 5Sample Output 2:
YES11 8 10 7 5 6 8Sample Input 3:
78 6 8 5 10 9 11Sample Output 3:
NO
#include "iostream"using namespace std;int cnt;bool isBST(int a[], int l, int r) {int k = l + 1;int mid = l;if (l < r) {while (a[k] < a[l]) {mid = k;k++;if (k > r)break;}for (; k <= r; k++) {if (a[k] < a[l]) {return 0;}}if (mid == l || mid == r)return isBST(a, l+1, r);elsereturn isBST(a, l + 1, mid) && isBST(a, mid + 1, r);}if (l == r)return 1;}bool isMirrorBST(int a[], int l, int r) {int k = l + 1;int mid = l;if (l < r) {while (a[k] >= a[l]) {mid = k;k++;if (k > r)break;}for (; k <= r; k++) {if (a[k] >= a[l]) {return 0;}}if (mid == l || mid == r)return isMirrorBST(a, l + 1, r);elsereturn isMirrorBST(a, l + 1, mid) && isMirrorBST(a, mid + 1, r);}if (l == r)return 1;}void getPostOrderFromPreOrder(int a[],int l,int r) {int k = l + 1;int mid = l;if (l < r) {while (a[k] < a[l]) {mid = k;k++;if (k > r)break;}if(mid == l || mid ==r)getPostOrderFromPreOrder(a, l + 1, r);if (mid != l&&mid != r) {getPostOrderFromPreOrder(a, l + 1, mid);getPostOrderFromPreOrder(a, mid + 1, r);}}if (cnt == 1) {cout << a[l];cnt++;}elsecout << " " << a[l];}void getPostOrderFromPreOrder1(int a[], int l, int r) {int k = l + 1;int mid = l;if (l < r) {while (a[k] >= a[l]) {mid = k;k++;if (k > r)break;}if (mid == l || mid==r)getPostOrderFromPreOrder1(a, l + 1, r);if (mid != l && mid!= r) {getPostOrderFromPreOrder1(a, l + 1, mid);getPostOrderFromPreOrder1(a, mid + 1, r);}}if (cnt == 1) {cout << a[l];cnt++;}elsecout << " " << a[l];}int main() {int n;int a[1002];cin >> n;for (int i = 0; i < n; i++)cin >> a[i];bool flag1 = isBST(a, 0, n - 1);bool flag2 = isMirrorBST(a, 0, n - 1);bool flag = flag1 || flag2;if (flag) {cout << "YES" << endl;if (flag1) {cnt = 1;getPostOrderFromPreOrder(a, 0, n - 1);}else if (flag2) {cnt = 1;getPostOrderFromPreOrder1(a, 0, n - 1);}cout << endl;}elsecout << "NO" << endl;return 0;}
- PAT A 1043. Is It a Binary Search Tree (25)
- PAT-A-1043. Is It a Binary Search Tree (25)
- pat-a 1043. Is It a Binary Search Tree (25)
- 1043. Is It a Binary Search Tree (25)—PAT
- 【PAT】1043. Is It a Binary Search Tree (25)
- 浙大 PAT 1043. Is It a Binary Search Tree (25)
- PAT 1043. Is It a Binary Search Tree (25)
- PAT (Advanced) 1043. Is It a Binary Search Tree (25)
- 【PAT】1043. Is It a Binary Search Tree (25)
- PAT 1043. Is It a Binary Search Tree (25)
- pat 1043. Is It a Binary Search Tree (25)
- PAT 1043. Is It a Binary Search Tree (25)
- pat 1043. Is It a Binary Search Tree (25)
- 【PAT甲级】1043. Is It a Binary Search Tree (25)
- 1043. Is It a Binary Search Tree (25) PAT甲级
- PAT甲级1043. Is It a Binary Search Tree (25)
- pat 1043. Is It a Binary Search Tree (25)
- PAT 1043. Is It a Binary Search Tree (25)
- C++中的static
- 引用---引用型参数
- java实现单例模式--懒汉式
- java8之lambda表达式
- format()方法
- PAT 1043. Is It a Binary Search Tree (25)
- centos 7上nginx+uwsgi 性能调优
- NPOI导出excel表格某些单元格或者列报未将对象引用设置到对象的实例
- ST集成传感器方案实现电子罗盘功能
- caffe基础-09solver超参数文件配置
- 完全图解VS2017安装过程并演示VS2017创建Linux项目和调试
- JavaWeb项目 Web.xml文件详解(启动顺序)
- [HDU]2222 Keywords Search
- LeetCode(27)--Remove Element