Tree UVA 548 （遍历序列建立二叉树+dfs遍历）

本文链接：https://blog.csdn.net/m0_46070659/article/details/108891027

该博客主要讲述了如何通过输入的中序和后序遍历序列来构建二叉树，并使用深度优先搜索（DFS）找到具有最小路径值的叶节点。在给定的输入文件中，每行包含一棵二叉树的中序和后序遍历值序列，所有值都小于10000且唯一。博客提供了解决这个问题的思路和代码实现。

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

题目链接
You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.

Input

The input file will contain a description of the binary tree given as the inorder and postorder traversal sequences of that tree. Your program will read two line (until end of file) from the input file. The first line will contain the sequence of values associated with an inorder traversal of the tree and the second line will contain the sequence of values associated with a postorder traversal of the tree. All values will be different, greater than zero and less than 10000. You may assume that no binary tree will have
more than 10000 nodes or less than 1 node.

Output

For each tree description you should output the value of the leaf node of a path of least value. In the case of multiple paths of least value you should pick the one with the least value on the terminal node.

Sample Input

3 2 1 4 5 7 6
3 1 2 5 6 7 4
7 8 11 3 5 16 12 18
8 3 11 7 16 18 12 5
255
255

Sample Output

1
3
255

思路：

根据中序遍历序列和后序遍历序列可以唯一的确定一棵二叉树，之后对二叉树进行dfs遍历，找出结点值总和最小的结点编号，输出权值即可。具体见代码，赋有测试样例

代码：

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#