POJ 2255 Tree Recovery
来源:互联网 发布:mac 美服lol下载教程 编辑:程序博客网 时间:2024/05/16 09:02
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:
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!
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 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.
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 ABCDEFGBCAD CBAD
Sample Output
ACBFGEDCDAB
language:c++
code:
#include <cstdio>#include <cstring>#include <iostream>#include <string>#define MAXN 11111using namespace std;int n;string ans="/", cmd, add;int main(){for(cin>>n; n--; ){cin>>cmd; if(cmd=="pwd") { cout<<ans<<endl; continue; }cin>>add;if(add[0]=='/') ans=add+'/'; else ans=ans+add+'/';for(int i=0; i<ans.size(); i++){if(ans[i]=='.'){int sum=0, j, k;for(j=i+1, k=0; j>=0; j--){sum++;if(ans[j]=='/') k++;if(k==2) break;}ans.erase(j, sum);i=0;}}}return 0;}
- poj 2255 Tree Recovery
- Tree Recovery---POJ--2255
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- poj 2255 Tree Recovery
- POJ 2255: Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- poj 2255 Tree Recovery
- POJ 2255 Tree Recovery
- poj-2255-Tree Recovery
- poj 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ 2255 Tree Recovery
- POJ--2255 Tree recovery
- POJ 2255 Tree Recovery
- oracle随机操作
- 几个常见的C函数
- Kinect开发-->OpenNI的安装及应用
- 使用jquery插件jquery.form.js,异步提交表单 1
- 魂断紅顔的伤感心情日志推荐:物是人非的那个夏天
- POJ 2255 Tree Recovery
- Android 实时视频编码—H.264硬编码
- 关于android 系统开发文章整理
- 关于如何创建Access Group
- linux内核源码编译,制作可启动内核镜像
- C函数库介绍: string.h、mem.h
- 一次阿里巴巴的听讲座心得
- Python的未来 future模块
- 堆、队列、java实现