【解题报告】【浙大PAT】03-树1. List Leaves (25)
来源:互联网 发布:2017钓鱼网站源码 编辑:程序博客网 时间:2024/05/29 02:30
03-树1. List Leaves (25)
Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=10) 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 test case, print in one line all the leaves' indices in the order of top down, and left to right. There must be exactly one space between any adjacent numbers, and no extra space at the end of the line.
Sample Input:81 -- -0 -2 7- -- -5 -4 6Sample Output:
4 1 5
题意,先输入结点个数N,然后输入从0到N-1结点的左右儿子,最后按照层次遍历输出叶子结点。
代码如下:
#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct{int lchild;int rchild;}bitree;typedef struct{int front;int rear;int data[10];}queue;int main(){char l,r;//输入左右子树bitree bt[10];queue q;int child[10];//检测根结点memset(child,0,sizeof(child));int root,n,i,j;scanf("%d",&n);getchar();for(i=0;i<n;i++){scanf("%c %c",&l,&r);//输入第i个结点左右子树getchar();if(l=='-')bt[i].lchild=-1;else if(l>='0'&&l<='9'){bt[i].lchild=l-'0';child[bt[i].lchild]++;}if(r=='-')bt[i].rchild=-1;else if(r>='0'&&r<='9'){bt[i].rchild=r-'0';child[bt[i].rchild]++;}}for(i=0;i<n;i++){if(!child[i]){root=i;//找根结点break;}}q.front=q.rear=0;i=0;q.data[0]=root;do{if(bt[root].lchild!=-1){q.data[++i]=bt[root].lchild;//左子树入队q.rear++;}if(bt[root].rchild!=-1){q.data[++i]=bt[root].rchild;//右子树入队q.rear++;}if(bt[root].lchild==-1&&bt[root].rchild==-1){printf("%d",root);if(n>1)printf(" ");elseprintf("\n");}root=q.data[++q.front];}while(q.front<n-1);if(n>1)printf("%d\n",root);return 0;}
- 【解题报告】【浙大PAT】03-树1. List Leaves (25)
- 解题报告-PAT-List Leaves
- PAT 03-树1. List Leaves (25)(C)
- 【解题报告】【浙大PAT】1051. Pop Sequence (25)
- 解题报告-PAT-Pop Sequence 浙大1051
- PAT 数据结构 03-树2. List Leaves (25)
- PAT - 03-树2 List Leaves (25分)
- PAT 03-2. List Leaves (25)
- PAT 03-2. List Leaves (25)
- MOOC浙大数据结构 — 03-树2 List Leaves (25分)
- 03-树1. List Leaves (25)
- 03-树1. List Leaves (25)
- 03-树1. List Leaves (25)
- 03-树1. List Leaves (25)
- 03-树1. List Leaves (25)
- 03-树1. List Leaves (25)
- PAT(Advanced Level) 1004 Counting Leaves 解题报告
- PAT (Advanced Level) 1004. Counting Leaves (30) 解题报告
- Java实现创建哈夫曼树
- 【HNOI2010】【BZOJ2001】City 城市建设2015.4.9编辑修改
- AOJ 0009 Prime Number (埃氏筛法)
- POJ 3243 Clever Y BSGS
- House Robber
- 【解题报告】【浙大PAT】03-树1. List Leaves (25)
- Android开发RadioButton(app主界面点击效果)
- spring错误解决方法整理(持续更新)
- 三月起步的英语
- 将博客搬至CSDN
- poj 1236 Network of Schools (强联通分量+缩点)
- 我的java学习笔记(14)关于反射(part 3)
- 工作之余休闲的55件事情
- 大神略过,linux jre安装以及环境变量的配置