Tree UVA - 548 （中序和后序，求根节点到叶节点的和最小）

最新推荐文章于 2021-07-29 20:46:19 发布
最新推荐文章于 2021-07-29 20:46:19 发布
阅读量215 收藏
点赞数
分类专栏： 二叉树SBT
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/XYBDX/article/details/98884023
版权
给定一棵二叉树的中序和后序遍历序列，你需要找到从根节点到叶节点的路径，使得路径上的节点值之和最小。如果有多个这样的路径，输出叶节点值最小的那个。输入包含多组数据，每组数据对应一棵树的中序和后序遍历序列，所有数值都在1到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 shou

最低0.47元/天 解锁文章
「已注销」
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
vue el-tree 默认展开第一个节点的实现代码
10-15
主要介绍了vue el-tree 默认展开第一个节点的实现代码,本文通过实例代码给大家介绍的非常详细，对大家的学习或工作具有一定的参考借鉴价值，需要的朋友可以参考下
a-tree 树型选择菜单组件关联节点选中动态设置
08-21
菜单多选设置，可用于权限多选，菜单多选等更多多选场景内使用。描述,通过树型弹框可以点击选择不同节点，且动态关联节点...如果勾选，则选中父节点则子节点自动选中，取消反选，如果取消勾选，则父子节点没有关联；
UVA - 548 Tree(已知中后序---建树---找路径最小的根节点)
zaiyang遇见
08-08 121
题目链接：https://cn.vjudge.net/contest/317394#problem/I 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 翻译：给出的是中序遍历和后序遍历，求从根节点到叶节点的最短路径所对应的...
uva548 -treeDescription Download as PDF You are to determine the value of the leaf node in a given
katydid3018的博客
10-24 668
Description 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 pa
Tree （中序+后序还愿树，并求根到哪个叶的和最小）
自渡的博客
08-25 315
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 o...
Leetcode 742：Closest Leaf in a Binary Tree（超详细的解法！！！）
coordinate的博客
02-20 1037
Given a binary tree where every node has a unique value, and a target key k, find the value of the nearest leaf node to target k in the tree. Here, nearest to a leaf means the least number of edges tr...
742. Closest Leaf in a Binary Tree
Do not mess it up
12-10 748
Given a binary tree where every node has a unique value, and a target key k, find the closest leaf node to target k in the tree.A node is called a leaf if it has no children.In the following examples,...
Element-ui el-tree新增和删除节点后如何刷新tree的实例
10-14
2. **刷新节点状态**：为了让`el-tree`组件知道有新节点需要加载，我们需要设置节点的`loaded`属性为`false`，表示该节点的数据未加载。接着，通过调用`node.expand()`方法，触发节点的加载请求，从而更新视图。 ``...
php-leetcode题解之从中序与后序遍历序列构造二叉树.zip
最新发布
06-07
首先，从后序遍历序列中找到根节点，然后通过中序遍历序列找到根节点的分界点，以此来划分左子树和右子树。接着，递归地构造左子树和右子树。整个过程涉及字符串操作、数组操作以及递归调用。 以下是一个简化的PHP...
ElementUI中el-tree节点的操作的实现
10-15
在本教程中，我们将探讨如何实现`el-tree`节点的各种操作，包括获取选中节点的ID、添加节点、修改节点以及删除节点。 首先，让我们来看一下`el-tree`的基本配置。在HTML部分，`el-tree`组件接收`data`属性，这是树...
树的建立（二叉树）
马鸿飞的博客
07-29 249
树 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 fil
Tree
admin__的博客
08-26 154
题目： 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 ...
UVA-548 Trees
Yvetteweiss的博客
03-25 271
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
【日常学习】【二叉树遍历】Uva548 - Tree题解
西家家
03-17 1091
这道题目本身不难，给出后序遍历和中序遍历，求到节点最小路径的叶子，相同长度就输出权值小的叶子。 Uva上不去了，没法测。基本上是按照ruka的代码来的。直接上代码 //Uva548 Tree #include #include #include #include #include using namespace std; const int maxv=10000+10; int inorde
dfs建树求前序遍历 Tree （UVA 548）
不知所云的博客
12-06 171
Tree 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 ...
Tree UVA - 548 树的遍历--已知先序中序求权值。
Nicolas的博客
01-01 301
Tree  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 t...
输入中序和后序求先序c语言
06-11
以下是输入中序和后序求先序的 C 语言代码示例： ```c #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_SIZE 100 typedef struct TreeNode { char data; struct TreeNode *left; struct TreeNode *right; } TreeNode, *BinaryTree; // 根据中序和后序遍历序列创建二叉树 BinaryTree createTree(char *inorder, char *postorder, int len) { if (len <= 0) { return NULL; } BinaryTree root = (BinaryTree)malloc(sizeof(TreeNode)); root->data = *(postorder + len - 1); int index = 0; while (index < len && *(inorder + index) != root->data) { index++; } root->left = createTree(inorder, postorder, index); root->right = createTree(inorder + index + 1, postorder + index, len - index - 1); return root; } // 先序遍历二叉树 void preOrder(BinaryTree root) { if (root == NULL) { return; } printf("%c ", root->data); preOrder(root->left); preOrder(root->right); } int main() { char inorder[MAX_SIZE]; char postorder[MAX_SIZE]; printf("请输入中序遍历序列："); scanf("%s", inorder); printf("请输入后序遍历序列："); scanf("%s", postorder); int len = strlen(inorder); BinaryTree root = createTree(inorder, postorder, len); printf("得到的先序遍历序列为："); preOrder(root); printf("\n"); return 0; } ``` 输入中序和后序遍历序列，程序会自动构建出对应的二叉树，并输出先序遍历序列。

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值