數據結構上機測試4.1:二叉樹的遍歷與應用1

TimeLimit: 1000MS Memory Limit: 65536KB

SubmitStatistic

PRoblem Description

輸入二叉樹的先序遍歷序列和中序遍歷序列，輸出該二叉樹的后序遍歷序列。

Input

第一行輸入二叉樹的先序遍歷序列；第二行輸入二叉樹的中序遍歷序列。

Output

輸出該二叉樹的后序遍歷序列。

Example Input

ABDCEF

BDAECF

Example Output

DBEFCA

Hint

Author

#include<string.h>#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<queue>#include<iostream>using namespace std;typedef struct node{   char data;   struct node*l;   struct node*r;}tree;void huifu(char *xian,char *zhong,int len){  if(len==0)  return ;  tree *p = new tree;  p->data = *xian;  int i = 0;  for(;i<len;i++)  if(zhong[i]==*xian)  {     break;  }  huifu(xian+1,zhong,i);  huifu(xian+i+1,zhong+i+1,len-i-1);  cout<<p->data;  return ;}int main(){   char xian[102],zhong[102];   int i,len;   scanf("%s%s",xian,zhong);   len = strlen(xian);   huifu(xian,zhong,len);   cout<<endl;}/***************************************************User name: jk160505徐紅博Result: AcceptedTake time: 0msTake Memory: 152KBSubmit time: 2017-02-07 15:04:24****************************************************/