PAT甲级——1110 Complete Binary Tree (完全二叉树)
Given a tree, you are supposed to tell if it is a complete binary tree.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤) which is the total number of nodes in the tree -- and hence the nodes are numbered from 0 to N−1. Then N lines follow, each corresponds to a node, and gives the indices of the left and right children of the node. If the child does not exist, a -
will be put at the position. Any pair of children are separated by a space.
Output Specification:
For each case, print in one line YES
and the index of the last node if the tree is a complete binary tree, or NO
and the index of the root if not. There must be exactly one space separating the word and the number.
Sample Input 1:
9
7 8
- -
- -
- -
0 1
2 3
4 5
- -
- -
Sample Output 1:
YES 8
Sample Input 2:
8
- -
4 5
0 6
- -
2 3
- 7
- -
- -
Sample Output 2:
NO 1
题目大意:一棵树有N个节点,从0到N-1进行标记,每一行代表了一个节点的左孩子和右孩子的信息,若没有孩子,以'-'代替。要求判断它是否为完全二叉树,若是完全二叉树则输出"YES"以及最后一个节点的值,反之输出“NO”和根节点的值。
思路:建立二叉树 —> 寻找根节点 —> 判断是否为完全二叉树。二叉树用数组储存,将'-'转换成-1来标明左孩子或者右孩子为空;用bool数组isRoot来给孩子节点进行标记,然后遍历isRoot寻找根节点;最后进行完全二叉树的判断,判断的依据是:层序遍历该二叉树,1、若当前节点的左孩子为空,右孩子不为空,则非完全二叉树;2、若发现某个节点没有右孩子则进行标记,在这之后入队的节点如果不是叶子节点那么就不是完全二叉树。
#include <iostream>
#include <vector>
#include <string>
#include <queue>
using namespace std;
struct node {
int key, left, right;
};
int getNum(string &s);
bool isComplete(vector <node> &tree, int root, int &lastNode);
int main()
{
int N, root, lastNode;
scanf("%d", &N);
vector <node> tree(N);
vector <bool> isRoot(N, true);
for (int i = ; i < N; i++) {
string s1,s2;
cin >> s1 >> s2;
tree[i].key = i;
tree[i].left = getNum(s1);
tree[i].right = getNum(s2);
if (tree[i].left != -)
isRoot[tree[i].left] = false;
if (tree[i].right != -)
isRoot[tree[i].right] = false;
}
for (int i = ; i < N; i++)
if (isRoot[i]) {
root = i;
break;
}
bool flag = isComplete(tree, root, lastNode);
if (flag)
printf("YES %d\n", lastNode);
else
printf("NO %d\n", root);
return ;
}
bool isComplete(vector <node> &tree, int root, int &lastNode) {
bool flag = false;
queue <int> Q;
Q.push(root);
int t;
while (!Q.empty()) {
t = Q.front();
Q.pop();
if (tree[t].left == - && tree[t].right != -)
return false;
if (flag) {//在标记之后再次发现非叶子节点,不是完全二叉树
if (!(tree[t].left == - && tree[t].right == -)) {
return false;
}
}
if (tree[t].right == -)//如果发现某个节点没有右孩子,就标记下,在这之后进入队列的节点要都是叶子节点才能满足完全二叉树的性质
flag = true;
if (tree[t].left != -)
Q.push(tree[t].left);
if (tree[t].right != -)
Q.push(tree[t].right);
if (Q.empty())
lastNode = tree[t].key;
}
return true;
}
int getNum(string &s) {
if (s[] == '-')
return -;
int n = ;
for (int i = ; i<s.length(); i++)
n = n * + s[i] - '';
return n;
}
PAT甲级——1110 Complete Binary Tree (完全二叉树)的更多相关文章
- PAT 甲级 1110 Complete Binary Tree
https://pintia.cn/problem-sets/994805342720868352/problems/994805359372255232 Given a tree, you are ...
- PAT甲级——A1110 Complete Binary Tree【25】
Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each in ...
- PAT Advanced 1110 Complete Binary Tree (25) [完全⼆叉树]
题目 Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each ...
- PAT 1110 Complete Binary Tree[判断完全二叉树]
1110 Complete Binary Tree(25 分) Given a tree, you are supposed to tell if it is a complete binary tr ...
- [二叉树建树&完全二叉树判断] 1110. Complete Binary Tree (25)
1110. Complete Binary Tree (25) Given a tree, you are supposed to tell if it is a complete binary tr ...
- PAT 1110 Complete Binary Tree[比较]
1110 Complete Binary Tree (25 分) Given a tree, you are supposed to tell if it is a complete binary t ...
- 1110 Complete Binary Tree (25 分)
1110 Complete Binary Tree (25 分) Given a tree, you are supposed to tell if it is a complete binary t ...
- 1110 Complete Binary Tree
1110 Complete Binary Tree (25)(25 分) Given a tree, you are supposed to tell if it is a complete bina ...
- pat 甲级 1064. Complete Binary Search Tree (30)
1064. Complete Binary Search Tree (30) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHE ...
随机推荐
- Uncaught TypeError: Illegal invocation解决
jquery中报了这个错,仔细一看,有个使用ajax的地方,其中有个参数是从页面某个文本框获取的,本应该 $('#id').value ,被我写成了 $('id') .所以报错,目前已解决.
- RQNOJ 624 运动鞋:dp
题目链接:https://www.rqnoj.cn/problem/624 题意: 小明有奖学金啦!所以他要去买运动鞋. 总共有n款鞋,分别属于t个品牌. 每款鞋的价格为c[i],在小明心目中的价值为 ...
- 高效上网教程---资源软件搜索技巧(搜索好用软件或者app去哪些网站)
高效上网教程---资源软件搜索技巧(搜索好用软件或者app去哪些网站) 一.总结 一句话总结:查看下面这些网站用户推荐的 知乎:比如 小众软件 site:zhihu.com 简书:查看你需要的用户推荐 ...
- 开机时遇到grub rescue无法进入系统的解决方法
装双系统(win10和elementary os),elementary os是ubuntu的一个分支.在win10中合并了一块空白磁盘分区,再开机的时候出问题了. 遇到filesystem unkn ...
- stack_1.设计一个有getMin功能的栈
思路 : 生成两个栈($stack ,$stack_min ),往$stack塞数据($value)的时候 ,比较一下$value和$stack_min最上面的元素的大小,如果$value小,则压入$ ...
- codeforces 706C C. Hard problem(dp)
题目链接: C. Hard problem time limit per test 1 second memory limit per test 256 megabytes input standar ...
- MongoDB 使用经验笔记
bin下的mongod就是MongoDB的服务端进程,mongo就是其客户端,其它的命令用于MongoDB的其它用途如MongoDB文件导出等 启动方式: 1.直接启动,指定各项参数: /usr/lo ...
- kettle导数到user_用于left join_20160928
这篇博客主要是给mysql left join做铺垫,需要现在本地数据库创建一个users 数据表 然后去和 test_a03order表 left join 一.首先在local_db数据库先创建 ...
- ACM学习历程——POJ3321 Apple Tree(搜索,线段树)
Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will ...
- 监控mysql主从同步状态是否异常
监控mysql主从同步状态是否异常,如果异常,则发生短信或邮寄给管理员 标签:监控mysql主从同步状态是否异常 阶段1:开发一个守护进程脚本每30秒实现检测一次. 阶段2:如果同步出现如下错误号(1 ...