UVa536 Tree Recovery
来源:互联网 发布:java调用js 返回值 编辑:程序博客网 时间:2024/06/01 09:00
Description
Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creations:
D / \ / \ B E / \ \ / \ \ A C G / / F
To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree).
For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.
She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).
Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.
However, doing the reconstruction by hand, soon turned out to be tedious.
So now she asks you to write a program that does the job for her!
Input Specification
The input file will contain one or more test cases. Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)Input is terminated by end of file.
Output Specification
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).Sample Input
DBACEGF ABCDEFGBCAD CBAD
Sample Output
ACBFGEDCDAB
分析:
先序遍历的第一个值是根节点,利用这个与中序遍历结合建树。后序遍历递归输出。
代码:
#include <cstdio>#include <cstring>const int maxn = 30;char s[maxn];int pre_order[maxn], in_order[maxn];int left[maxn], right[maxn];int build(int L1, int R1, int L2, int R2) {if (L1 > R1) return 0;int root = pre_order[L1], p = L2;while (in_order[p] != root) p++;int cnt = p - L2;left[root] = build(L1 + 1, L1 + cnt, L2, L2 + cnt - 1);right[root] = build(L1 + cnt + 1, R1, L2 + cnt + 1, R2);return root;}void postSearch(int u) {if (u == 0) return;postSearch(left[u]);postSearch(right[u]);printf("%c", u + 'A' - 1);}int main() {while (~scanf("%s", s)) {int n = strlen(s);for (int i = 1; i <= n; i++) pre_order[i] = s[i - 1] - 'A' + 1;scanf("%s", s);for (int i = 1; i <= n; i++) in_order[i] = s[i - 1] - 'A' + 1;memset(left, 0, sizeof(left));memset(right, 0, sizeof(right));int root = build(1, n, 1, n);postSearch(root);puts("");}return 0;}
- uva536 Tree Recovery
- uva536 Tree Recovery
- UVA536 - Tree Recovery
- UVa536 Tree Recovery
- uva536 Tree Recovery
- UVA536 Tree Recovery
- uva536 -- Tree Recovery
- Tree Recovery UVA536
- UVA536 - Tree Recovery(递归)
- Uva536——Tree Recovery
- 二叉树重建(Tree Recovery ,UVa536)
- uva536-Tree Recovery-二叉树遍历
- 习题6-3 UVa536 Tree Recovery(树的遍历转换)
- Uva536 Tree Recovery 【递归建树】【习题6-3】
- [UVA548]Tree[根据中序后序构建树][UVA536]Tree Recovery[根据前序中序构建树]
- 算法竞赛入门经典 第二版 习题6-3 二叉树重建 Tree Recovery uva536
- uva536
- uva536
- Html5 缓存策略简介
- 打擂台算法
- UVA - 1592 Database map+pair
- Java求字符串数组交集 并集 差集 去重复并集
- TIPTOP ERP 常用SQL总结
- UVa536 Tree Recovery
- quick cocos2dx学习记录
- 大巧不工Web前端设计修炼之道——(8)浅谈Web发展的未来
- Android在onCreate()中获得控件尺寸
- Redis和Memcache的区别分析
- C++学习1--强制类型转换符
- 黑马程序员--C语言之流程控制
- 在linux上安装lrzsz
- C++第十四题20150408