TOJ 1144. Tree Recovery
2014-07-23 15:39
218 查看
第一次做二叉树的题目,继续加油!
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!
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.
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 ABCDEFG BCAD CBAD
Sample Output
ACBFGED CDAB
#include<iostream> #include<string> using namespace std; typedef struct BiTNode{ char data; struct BiTNode*lchild,*rchild; }BiTNode,*BiTree; BiTNode* makeTree(string pre,string in){ BiTNode *root=NULL; if(pre.size()!=0){ root=new BiTNode; root->data=pre[0]; int pos=in.find(pre[0]); root->lchild=makeTree(pre.substr(1,pos),in.substr(0,pos)); root->rchild=makeTree(pre.substr(pos+1),in.substr(pos+1)); } return root; } string sol(BiTNode *root){ string s; if(root){ s=s+sol(root->lchild); s=s+sol(root->rchild); s=s+root->data; } return s; } int main(){ string pre,in,s; while(cin>>pre>>in){ BiTNode *root= makeTree(pre,in); s=sol(root); cout<<s<<endl; } return 0; }
相关文章推荐
- toj1144 Tree Recovery
- [toj 1144] Tree Recovery
- TOJ 1752 POJ 2255 Tree Recovery
- toj 2485 Card Tric
- toj 3505. Naughty Mike(树状数组)
- TOJ 2233.WTommy's Trouble【有向图的强联通分量】
- PKU1144 network
- Tree Recovery(将树复原)
- TOJ 1959 POJ 1562 Oil Deposits BFS DFS入门题 C语言
- poj2255 Tree Recovery
- TOJ-3072 Train Order
- poj 1144 Network (无向图求割点)
- 数兔子 bjfu 1144 动态规划
- UVa 536 - Tree Recovery
- 3989. I guess the gift is a calculator! toj
- poj 2255 Tree Recovery
- TOJ 1225 数据结构练习题——Huffman Coding
- Poj 1144 Network
- toj2034 Just the Facts
- TOJ 4351 HDU 4259 Double Dealing