pat 1043
来源:互联网 发布:安卓源码怎么用 编辑:程序博客网 时间:2024/06/16 22:30
1043. Is It a Binary Search Tree (25)
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 <stdio.h>struct Tree{Tree *lchild;Tree *rchild;int data;} tree[1010];int loc = 0, n, node[1010];int peOd[1010], psOd[1010];int count = 0;Tree *creat(){tree[loc].lchild = tree[loc].rchild = NULL;return &tree[loc++];}Tree *build(Tree *T, int data){if(T == NULL){T = creat();T->data = data;return T;}else if(data >= T->data)T->rchild = build(T->rchild, data);else if(data < T->data)T->lchild = build(T->lchild, data);return T;}Tree *rbuild(Tree *T, int data){if(T == NULL){T = creat();T->data = data;return T;}else if(data >= T->data)T->lchild = rbuild(T->lchild, data);else if(data < T->data)T->rchild = rbuild(T->rchild, data);return T;}void preOrder(Tree *T){if(T != NULL){peOd[count++] = T->data;//printf("%d ", T->data);preOrder(T->lchild);preOrder(T->rchild);}}void postOrder(Tree *T){if(T != NULL){postOrder(T->lchild);postOrder(T->rchild);psOd[count++] = T->data;//printf("**%d ", T->data);}}int main(){int i, j;while(scanf("%d", &n) != EOF){Tree *T = NULL;for(i = 1; i <= n; i++)scanf("%d", &node[i]);for(i = 1; i <= n; i++)T = build(T, node[i]); //建立了一颗二叉排序树//判断该二叉排序树的前序序列是否为给定的序列count = 1;preOrder(T);for(i = 1; i <= n; i++)if(peOd[i] != node[i])break;if(i > n){printf("YES\n");count = 1;postOrder(T);for(i = 1; i < n; i++)printf("%d ", psOd[i]);printf("%d\n", psOd[n]);continue;}//判断二叉树的mirrorT = NULL;for(i = 1; i <= n; i++)T = rbuild(T, node[i]);count = 1;preOrder(T);for(i = 1; i <= n; i++)if(peOd[i] != node[i])break;if(i > n){printf("YES\n");count = 1;postOrder(T);for(i = 1; i < n; i++)printf("%d ", psOd[i]);printf("%d\n", psOd[n]);continue;}printf("NO\n");}return 0;}
- pat 1043
- pat 1043
- PAT 1043
- PAT 1043
- pat 1043
- PAT Advanced 1043
- pat advanced 1043
- PAT(甲级)1043
- PAT-1043 输出PATest
- 1043,输出PATest,PAT
- * 浙大PAT甲级 1043
- PAT乙级1043
- pat-bl-1043
- PAT甲级1043
- PAT 1043 输出PATest
- PAT A 1043
- PAT 1043输出PATest
- PAT basic 1043
- 为什么北漂
- php call_user_func
- iOS 应用程序内部国际化,不跟随系统语言
- Datagird样式
- Python range和xrange
- pat 1043
- iOS Xcode配置文件之Strings File文件
- Linux 多线程(转载)
- Volatile 变量
- BitmapFactory.Options详解
- micro bosh部署失败
- shell脚本中for、while和do的使用以及区别
- 2--3拓展,读入文件与结构体
- 关于PPTP协议、L2TP协议和SSTP协议