【PTA Data Structures and Algorithms (English)】7-4 List Leaves

最新推荐文章于 2024-09-08 09:59:00 发布

宇智波一打七~

最新推荐文章于 2024-09-08 09:59:00 发布

阅读量67

点赞数

分类专栏：算法题目文章标签：深度优先算法图论

本文链接：https://blog.csdn.net/weixin_51979465/article/details/129429458

版权

算法题目专栏收录该内容

111 篇文章 0 订阅

订阅专栏

该程序实现了一个功能，即给定一棵最多包含10个节点的二叉树，自顶向下、从左到右地列出所有叶子节点。它使用深度优先搜索（DFS）策略，通过节点深度进行排序。在DFS过程中，同时计算节点的深度，并在找到叶子节点时将其添加到结果向量中，最后对结果进行排序并输出。

摘要由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.

题意：

给你一棵树，节点最多是10，让你从上到下，从左到右来输出叶子节点

思路：

直接dfs，关键的点就是结构体排序，直接按照节点深度来排就行，左右的话在dfs序中已经排好了，下面看代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 15;
struct node{
	int l,r,depth;
}; 

node tr[N];
int f(string s){
	if(s == "-") return -1;
	return s[0]-'0';
}
struct Node{
	int data,depth,state;
	bool operator<(const Node&t)const{
		return depth < t.depth;
	}
};
vector<Node> ans;
void dfs(int u,int state){
	if(tr[u].l != -1) tr[tr[u].l].depth = tr[u].depth + 1,dfs(tr[u].l,0);
	if(tr[u].r != -1) tr[tr[u].r].depth = tr[u].depth + 1,dfs(tr[u].r,1);
	if(tr[u].l == -1 && tr[u].r == -1) ans.push_back({u,tr[u].depth,state});
}
int main(){
	int n;
	cin>>n;
	string l,r;
	map<int,int> mp;
	for(int i=0;i<n;i++){
		cin>>l>>r;
		tr[i] = {f(l),f(r),0};
		mp[f(l)] = mp[f(r)] = 1;
	}
	int root = -1;
	for(int i=0;i<n;i++) if(!mp[i]) root = i;
	tr[root].depth = 0;
	dfs(root,0);
	sort(ans.begin(),ans.end());
	for(int i=0;i<ans.size();i++){
		printf("%d",ans[i].data);
		if(i != ans.size()-1) printf(" ");
	}
	return 0;
}