1043. Is It a Binary Search Tree (25)
来源:互联网 发布:c专家编程亚马逊 编辑:程序博客网 时间:2024/05/19 10:09
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>#include<vector>using namespace std;vector<int> vecpre,vecChange,vecpost,seq;struct Node{Node *lChild;Node *rChild;int value;Node(){ lChild = NULL; rChild = NULL; value = 0; };};void insertNode(Node *&root, int val){if (!root){root = new Node();root->value = val;return;}if (val < root->value)insertNode(root->lChild, val);elseinsertNode(root->rChild,val);}void preOrder(Node *root){if (root){vecpre.push_back(root->value);preOrder(root->lChild);preOrder(root->rChild);}}void preOrderChange(Node *root){if (root){vecChange.push_back(root->value);preOrderChange(root->rChild);preOrderChange(root->lChild);}}void postOrder(Node *root){if (root){postOrder(root->lChild);postOrder(root->rChild);vecpost.push_back(root->value);}}void swap(Node *&root){if (root){Node *temp = root->lChild;root->lChild = root->rChild;root->rChild = temp;swap(root->lChild);swap(root->rChild);}}void printPostOrder(vector<int> vec){/*for (vector<int>::iterator it = vec.begin(); it != vec.end(); ++it){printf("%d ", *it);}*/for (int i = 0; i < vec.size() - 1; ++i){printf("%d ",vec[i]);}printf("%d",vec[vec.size()-1]);}int main(){int N, key;scanf("%d",&N);Node *root = NULL;for (int i = 0; i < N; ++i){scanf("%d", &key);seq.push_back(key);insertNode(root,key);}vecpre.clear();preOrder(root);vecChange.clear();preOrderChange(root);if (vecpre == seq){printf("%s\n","YES");vecpost.clear();postOrder(root);printPostOrder(vecpost);}else if (vecChange == seq){printf("%s\n", "YES");swap(root);vecpost.clear();postOrder(root);printPostOrder(vecpost);}elseprintf("%s\n","NO");return 0;}
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043.Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 1043. Is It a Binary Search Tree
- 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)
- Is It a Binary Search Tree (25)
- 1043. Is It a Binary Search Tree (25)
- 1043. Is It a Binary Search Tree (25)—PAT
- VMware 11安装Mac OS X 10.10
- php使用gd库将文字转换成图片
- SAE-servlet---服务器端程序编写
- Android仿相册点击屏幕出现标题和底部菜单
- MySQL存储过程详解
- 1043. Is It a Binary Search Tree (25)
- IOS中SQLite3使用
- CodeForces 238C World Eater Brothers 树形dp
- Android 高仿微信头像截取 打造不一样的自定义控件
- iphone 6 plus 人気 とまだ、このサイト特にベッドが片側にこのキー事実小さな印刷装置を設定する事に
- 【Python】 Python输入和输出
- mosquitto1.4 websocket js客户端测试
- MVC中的Html.ActionLink的介绍
- Android-->将布局文件放在服务器上,动态改变布局。