PAT A1102 invert a binary tree (25)
来源:互联网 发布:暗黑破坏神3画面优化 编辑:程序博客网 时间:2024/05/22 02:29
#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
bool notroot[12]={false};
int n;
vector<int> level,in;
struct node{
int lchild,rchild;
}node[12];
int findroot(){
int i;
for(i=0;i<n;i++){
if(notroot[i]==false) return i;
}
}
void BFS(int root){
queue<int> q;
q.push(root);
while(!q.empty()){
int front=q.front();
q.pop();
level.push_back(front);
if(node[front].rchild!=-1) q.push(node[front].rchild);
if(node[front].lchild!=-1) q.push(node[front].lchild);
}
for(int i=0;i<n;i++){
if(i<n-1) printf("%d ",level[i]);
else printf("%d\n",level[i]);
}
}
void inorder(int root){
if(node[root].rchild!=-1) inorder(node[root].rchild);
in.push_back(root);
if(node[root].lchild!=-1) inorder(node[root].lchild);
}
int main(){
scanf("%d",&n);
getchar();
int i;
char left,right;
for(i=0;i<n;i++){
scanf("%c %c",&left,&right);
getchar();
if(left=='-') node[i].lchild=-1;
else{
node[i].lchild=left-'0';
notroot[node[i].lchild]=true;
}
if(right=='-') node[i].rchild=-1;
else{
node[i].rchild=right-'0';
notroot[node[i].rchild]=true;
}
}
int root=findroot();
BFS(root);
inorder(root);
for(int i=0;i<n;i++){
if(i<n-1) printf("%d ",in[i]);
else printf("%d\n",in[i]);
}
system("pause");
return 0;
}
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
bool notroot[12]={false};
int n;
vector<int> level,in;
struct node{
int lchild,rchild;
}node[12];
int findroot(){
int i;
for(i=0;i<n;i++){
if(notroot[i]==false) return i;
}
}
void BFS(int root){
queue<int> q;
q.push(root);
while(!q.empty()){
int front=q.front();
q.pop();
level.push_back(front);
if(node[front].rchild!=-1) q.push(node[front].rchild);
if(node[front].lchild!=-1) q.push(node[front].lchild);
}
for(int i=0;i<n;i++){
if(i<n-1) printf("%d ",level[i]);
else printf("%d\n",level[i]);
}
}
void inorder(int root){
if(node[root].rchild!=-1) inorder(node[root].rchild);
in.push_back(root);
if(node[root].lchild!=-1) inorder(node[root].lchild);
}
int main(){
scanf("%d",&n);
getchar();
int i;
char left,right;
for(i=0;i<n;i++){
scanf("%c %c",&left,&right);
getchar();
if(left=='-') node[i].lchild=-1;
else{
node[i].lchild=left-'0';
notroot[node[i].lchild]=true;
}
if(right=='-') node[i].rchild=-1;
else{
node[i].rchild=right-'0';
notroot[node[i].rchild]=true;
}
}
int root=findroot();
BFS(root);
inorder(root);
for(int i=0;i<n;i++){
if(i<n-1) printf("%d ",in[i]);
else printf("%d\n",in[i]);
}
system("pause");
return 0;
}
0 0
- PAT A1102. Invert a Binary Tree (25)
- PAT A1102 invert a binary tree (25)
- PAT A1102. Invert a Binary Tree
- A1102. Invert a Binary Tree (25)
- A1102. Invert a Binary Tree (25)
- [PAT]1102. Invert a Binary Tree (25)
- 【PAT】1102. Invert a Binary Tree (25)
- PAT 1102. Invert a Binary Tree (25)
- PAT 1102. Invert a Binary Tree (25)
- pat 1102. Invert a Binary Tree (25)
- PAT 1102. Invert a Binary Tree (25)
- 【PAT】1102. Invert a Binary Tree (25)
- PAT 1102. Invert a Binary Tree (25)
- PAT 1102. Invert a Binary Tree (25)
- PAT(A) - 1102. Invert a Binary Tree (25)
- PAT(A)-1102. Invert a Binary Tree (25)(数据结构+bfs)
- PAT A 1102. Invert a Binary Tree (25)
- Pat(A) 1102. Invert a Binary Tree (25)
- 理解快速排序
- webstorm或IJ Idea 在线激活方法
- 计算当前场景顶点数和面数
- 股市公式编辑器
- C++格式化输出流
- PAT A1102 invert a binary tree (25)
- 一个技术汪的开源梦 —— 微信开发工具包
- window下自动修改Android的prop配置文件
- codevs动态规划 金明的预算方案
- PAT (Advanced Level) 1036. Boys vs Girls (25) 解题报告
- <HDU 2072> 单词数
- 点击事件(v-on:click)
- .net 移动api开发基本教程
- Android ListView 几个重要属性