poj2255 二叉树给出先序中序求后序序列

 

Tree Recovery

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4858		Accepted: 3240

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

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. 

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

方法1：递归建树，后序循环

#include<malloc.h>
#include <string>
#include <iostream>
using namespace std;

#define OK 1
#define FALSE 0

typedef char status;
typedef struct Node
{
	status data;
	struct Node *LTree,*RTree;
}BinaryTree;
/*PreCreateTree先序创建BinaryTree*/

BinaryTree* Pre_Mid_CreateTree(string pre,string mid)  
{  
	BinaryTree* root = NULL;  
	if(pre.length()>0)  
	{  
		root = new Node;  
		root->data = pre[0];  
		int index = mid.find(root->data);  
		root->LTree = Pre_Mid_CreateTree(pre.substr(1,index),mid.substr(0,index));  
		root->RTree = Pre_Mid_CreateTree(pre.substr(index+1),mid.substr(index+1));  
	}  
	return root;  
}  

void PastOrderTraverse(BinaryTree *head)
{
	if (head != NULL)
	{
		PastOrderTraverse(head->LTree);
		PastOrderTraverse(head->RTree);
		printf("%c",head->data);
	}
}

int main()
{
	BinaryTree *head=NULL;
	string pre,mid;
	while (cin>>pre>>mid)
	{
		head = Pre_Mid_CreateTree(pre,mid);
		PastOrderTraverse(head);
		printf("/n");
	}

} 

方法2: 利用特殊的格式规律

#include <iostream>
#include <string>
using namespace std;
char pre[100];//先序遍历
char mid[100];//中序遍历
char post[100];//后序遍历

int len;

void FindPost(int p1,int p2,int m1,int m2)
{
	if (p1<=p2)
	{
		int i;
		for (i=m1;i<=m2;i++)
		{
			if (mid[i]==pre[p1]) break;
		}
		post[--len] = pre[p1];
		FindPost(p1+(i-m1)+1,p2,i+1,m2);
		FindPost(p1+1,p1+(i-m1),m1,i-1);
	}
	else
		return;
}

int main()
{
	while(cin>>pre>>mid)
	{
		int n = strlen(pre);
		len = n;
		FindPost(0,n-1,0,n-1);
		int i;
		cout<<post<<endl;
	}
	return 0;
}