UVA - Tree Recovery(二叉树)
发布日期:2021-07-01 00:16:15
浏览次数:2
分类:技术文章
本文共 2183 字,大约阅读时间需要 7 分钟。
题目链接:
Time limit: 3.000 secondsDescription
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
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
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 ABCDEFG
BCAD CBAD
Sample Output
ACBFGED
CDAB
Problem solving report:
Description: 给出二叉树的先序遍历和中序遍历,求后序遍历。
Problem solving: 利用先序和后序的性质,递归模拟一下就行了。#include#include int pst;char preorder[30], inorder[30];void solve(int l, int r){ int i; char root = preorder[pst]; if (l >= r) return; for (i = l; i < r; i++) if (inorder[i] == preorder[pst]) break; pst++; solve(l, i); solve(i + 1, r); printf("%c", root);}int main(){ while (~scanf("%s%s", preorder, inorder)) { pst = 0; solve(0, strlen(inorder)); printf("\n"); } return 0;}
转载地址:https://lzyws739307453.blog.csdn.net/article/details/86671884 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!
发表评论
最新留言
感谢大佬
[***.8.128.20]2024年04月23日 02时20分27秒
关于作者
喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!
推荐文章
Html当中文本与标签如何居中
2019-05-01
Python引用2(Django系列3)
2019-05-01
信息列表+上传文件
2019-05-01
Python中常用的模块--Log日志模块
2019-05-01
通过JS实现轮播图
2019-05-01
Django通过HttpResponse如何返回用户头像
2019-05-01
深入理解RabbitMQ消息队列的使用-张明阳-专题视频课程
2019-05-01
Hive表生成函数之---explode函数应用
2019-05-01
Hadoop中的jobhistory配置与启动停止
2019-05-01
POJ 1611 The Suspects
2019-05-01
HDOJ 1051 Wooden Sticks
2019-05-01
HDOJ 1009 FatMouse' Trade
2019-05-01
HDOJ 1050 Moving Tables
2019-05-01
HDOJ 1800 Flying to the Mars
2019-05-01
HDOJ 2111 Saving HDU
2019-05-01
HDOJ 2570 迷瘴
2019-05-01
Codeforces 437A The Child and Homework
2019-05-01
Codeforces 433C Ryouko's Memory Note
2019-05-01
HDOJ 1286 找新朋友
2019-05-01
欧拉函数讲解
2019-05-01