03-树2 List Leaves (25 分) （根据输入找树的头节点，然后再用队列层次遍历正确顺序输出叶子结点）-CSDN博客

本文链接：https://blog.csdn.net/m0_49840707/article/details/120709761

给定一棵树的节点数和每个节点的左右孩子，按从上到下、从左到右顺序列出所有叶子节点。题目要求首先找到根节点，然后层次遍历，利用队列判断并输出叶子节点。

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

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:
8
1 -

0 -
2 7

5 -
4 6
结尾无空行
Sample Output:
4 1 5
结尾无空行

这题的大概意思是给出二叉树的左右子树结点编号，叫你把叶子节点按从上到下，从左到右的顺序输出
很显然，这题和上一题的相似之处都是首先找到根节点，然后再对二叉树进行层次遍历算法，然后把每一个遍历的结点放入队列中，同时判断其是否为叶子节点，（即左右子树是否为NULL），如果是则输出，这样的话，输出来的就是从上到下，从左到右了。一开始没有看到从上到下，结果直接中序遍历了，就通过不了。下面为代码：

#include<iostream>
using namespace std;
const int MaxSize = 10;
const int Null = -1;
int a[MaxSize];
int flag = 0;
//建立队列
typedef struct {
   
	int data[MaxSize];
	int front, rear;
}SqQueue;
void InitQueue(SqQueue*& q)
{
   
	q = new SqQueue;
	q->front = q->rear = -1;
}
void DestroyQueue