1043. Is It a Binary Search Tree (25)
2016-09-14 21:41
513 查看
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
不知为何,同样的代码,有时候全部通过,有时候测试点3,5会报错。
#include <stdio.h> #include <stdlib.h> int b[1100]; int index; void Check(int *a,int start,int end) { int middle,temp; if(start > end) { return; } if(start == end) { b[index] = a[start]; index++; return; } middle = start + 1; while(a[middle] < a[start]) //找到右子树根节点 { middle++; } temp = middle; while(middle <= end) //右子树每一个节点应大于等于根节点 { if(a[middle] < a[start]) { return; } middle++; } Check(a,start+1,temp-1); Check(a,temp,end); b[index] = a[start]; index++; } void MirrorCheck(int *a,int start,int end) { int middle,temp; if(start > end) { return; } if(start == end) { b[index] = a[start]; index++; return; } middle = start + 1; while(a[middle] >= a[start]) //找到右子树根节点 { middle++; } temp = middle; while(middle < end) { if(a[middle] >= a[start]) { return; } middle++; } MirrorCheck(a,start+1,temp-1); MirrorCheck(a,temp,end); b[index] = a[start]; index++; } int main() { int a[1100]; int N,i,flag=1; scanf("%d",&N); for(i=0;i<N;i++) { scanf("%d",&a[i]); } if(a[0] < a[1]) { MirrorCheck(a,0,N-1); } else { Check(a,0,N-1); } if(N != index) { printf("NO\n"); } else { puts("YES"); for(i=0;i<index;i++) { if(flag) { printf("%d",b[i]); flag = 0; } else { printf(" %d",b[i]); } } } //system("pause"); return 0; }
相关文章推荐
- 浙大 PAT 1043. Is It a Binary Search Tree (25)
- 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 A 1043. Is It a Binary Search Tree (25)
- PAT Advanced Level 1043. Is It a Binary Search Tree (25)(Java and C++)
- 1043. Is It a Binary Search Tree (25)
- PAT (Advanced Level) 1043. Is It a Binary Search Tree (25)
- PAT (Advanced) 1043. Is It a Binary Search Tree (25)
- PAT-A-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)
- 1043. Is It a Binary Search Tree (25)
- PAT - 甲级 - 1043. Is It a Binary Search Tree (25)(递归建树,求后序,BST)
- 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 (Advanced Level) Practise
- 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)