2255:Tree Recovery

題目分析：使用前序序列和中序序列構造后序序列的題。當時面微軟實習生的時候還問過這個。

前序的第一個節點就是后序的最后一個節點，且該節點把中序序列劃分成左右兩個子樹。中序的這兩個子樹對應著前序的兩個子樹，他們的長度分別相等。

代碼如下：

#include <iostream> #include <string> using namespace std; string getPost(string pre,string in){if(pre.length() == 0)return "";//注意邊界條件if(pre.length() == 1)return pre;char root = pre[0];int len = in.find(root);return getPost(pre.substr(1,len),in.substr(0,len)) + getPost(pre.substr(1+len),in.substr(1+len)) + root; } int main(){string pre,in;while(cin>>pre){cin>>in;cout<<getPost(pre,in)<<endl;}return 0; }題目：

時間限制: 1000ms 內存限制: 65536kB
描述
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!


輸入
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.


輸出
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
樣例輸入
DBACEGF ABCDEFG
BCAD CBAD
樣例輸出
ACBFGED
CDAB

轉載于:https://www.cnblogs.com/zhuyuanhao/archive/2012/10/03/3262878.html

總結

以上是生活随笔為你收集整理的POJ2255Tree Recovery的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。