#数据结构与算法学习笔记#PTA10：层次遍历叶节点（JAVA）

最新推荐文章于 2023-05-20 12:34:04 发布

NJU_ChopinXBP

最新推荐文章于 2023-05-20 12:34:04 发布

阅读量323

点赞数 2

分类专栏： PTA JAVA 数据结构与算法文章标签：数据结构与算法 PTA 二叉树层次遍历叶节点

本文链接：https://blog.csdn.net/qq_20304723/article/details/79874183

版权

本文记录了一道PTA题目，要求按层次遍历二叉树并输出叶节点，顺序为从上到下、从左到右。通过使用队列进行层次遍历，依次将节点入队并检查其子节点，直至队列为空。输入包含树的节点数及各节点的子节点信息，输出所有叶节点的顺序。

摘要由CSDN通过智能技术生成

2018.4.9

要求寻找一棵二叉树的叶节点，并且按从上到下、从左到右的顺序打印出来。

题目难点在于如何层次遍历一颗二叉树，主要思想是利用队列层次遍历一棵树，先将根节点入队，每次出队时检查是否有左右子根节点，若有则子节点入队，直到队列为空。没有什么大坑。

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 ad