数据结构——List Leaves
来源:互联网 发布:淘宝卖家如何做活动 编辑:程序博客网 时间:2024/04/27 21:52
题目:
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 6
Sample Output:
4 1 5
题目来源:程序设计实验辅助教学题目分析:
通过输入节点数以及每个节点的左儿子和右儿子,从上到下打印出叶节点。要理解输入的第几行就是代表该节点的值为几。例如样例输入中,第0行的 1 - 代表值为0的节点左孩子的值为1,即指向第1行,右孩子为空,第1行的 - -代表为1的节点的左右孩子都为空。树模型如下:
程序代码:
#define MaxTree 10#define ElementType char#define Tree int#define Null -1#include<stdio.h>#include<stdlib.h>typedef struct {ElementType Element;Tree Left;Tree Right;}TreeNode;TreeNode T[MaxTree];TreeNode Queue[MaxTree];int front = -1, rear = -1;void AddQ(TreeNode tn);TreeNode DeleteQ();void listLeaves(int root, int n);int main(){int i, N, Root;char cl, cr;scanf("%d", &N);getchar();if (N){int check[8];//用来判断根节点的数组for (i = 0; i < N; i++){check[i] = 0;}for (i = 0; i < N; i++){scanf("%c %c", &cl, &cr);getchar();T[i].Element = i; // if (cl != '-'){T[i].Left = cl - '0';check[T[i].Left] = 1;}else{T[i].Left = Null;}if (cr != '-'){T[i].Right = cr - '0';check[T[i].Right] = 1;}else{T[i].Right = Null;}}for (i = 0; i < N; i++){if (!check[i]){Root = i;break;}}}listLeaves(Root, N);return 0;}// 插入队列void AddQ(TreeNode treeNode){Queue[++rear] = treeNode;}// 从队列中删除元素TreeNode DeleteQ(){return Queue[++front];}void listLeaves(int root, int n){int leaves[MaxTree];int k = 0;AddQ(T[root]);for (int i = 0; i < n; i++){TreeNode tn= DeleteQ();if (tn.Left == Null && tn.Right == Null)leaves[k++] = tn.Element;if (tn.Left != Null)AddQ(T[tn.Left]);if (tn.Right != Null)AddQ(T[tn.Right]);}for (int i = 0; i < k - 1; i++)printf("%d ", leaves[i]);printf("%d\n",leaves[k-1]);}参考代码:点击打开链接
- 数据结构——List Leaves
- PTA——List Leaves
- List Leaves【数据结构测试3.2】
- MOOC浙大数据结构 — 03-树2 List Leaves (25分)
- 树2——List Leaves
- List Leaves
- List Leaves
- List Leaves
- List Leaves
- List Leaves
- List leaves
- List Leaves
- List Leaves
- List Leaves
- PAT 数据结构 03-树2. List Leaves (25)
- 中国大学MOOC-陈越、何钦铭-数据结构 List Leaves
- 数据结构习题回顾与总结 (2) List Leaves
- 数据结构——list
- spring 通过中间层工具类SpringBeanFactoryUtils 实现service 注入
- 错误:undefined reference to `manualScene::setMode(manualScene::Mode)'
- Java4android学习笔记22-23
- [Fedora Armhf 和 ROS]ROS Indigo 安装缺失的系统 package
- 如何学习设计模式
- 数据结构——List Leaves
- poj 1028
- 互联网思维
- LETTERS(搜索)dfs
- 10 24
- Hive数据仓库-Sqoop将数据从Mysql导入Hive中
- Android style样式文件的使用
- CI框架源码解析十一之安全类文件Security.php
- PostgreSQL 添加各种约束语法