例子,后序遍历为 gbdehfca,中序遍历为 dgbaechf
后序遍历中的最后一个元素是根节点,a,然后查找中序中a的位置
把中序遍历分成 dgb a echf,而因为节点个数要对应
后序遍历分为 gbd ehfc a,gbd为左子树,ehfc为右子树,这样又可以递归计算了
最后形成的二叉树如下图片所示:
![](https://img.laitimes.com/img/_0nNw4CM6IyYiwiM6ICdiwiIml2Zuo3QjVzNycDM1IDOxMTMfBzLcBTMvwFMxETMwIzLcRnbl1GajFGd0F2LcRXZu5ibkN3YukGavw1LcpDc0RHaiojIsJye.gif)
具体代码如下:
递归:
[cpp] view plain copy print ?
- #include<iostream.h>
- #include<string.h>
- #include<stdlib.h>
- #define MAX 20
- typedef struct tnode
- {
- char data;
- struct tnode *lchild;
- struct tnode *rchild;
- } *bt;
- void in_post_to_bt(char *in,char *post,int len,bt &T)
- {
- int k;
- if(len<=0)
- {
- T=NULL;
- return;
- }
- for(char *temp=in;temp<in+len;temp++)
- if(*(post+len-1)==*temp)
- {
- k=temp-in;
- T=(bt)malloc(sizeof(struct tnode));
- T->data =*temp;
- break;
- }
- in_post_to_bt(in,post,k,T->lchild );
- in_post_to_bt(in+k+1,post+k,len-k-1,T->rchild );
- }
- void in_visit(bt T)
- {
- if(T)
- {
- in_visit(T->lchild );
- cout<<T->data ;
- in_visit(T->rchild );
- }
- }
- void post_visit(bt T)
- {
- if(T)
- {
- post_visit(T->lchild );
- post_visit(T->rchild );
- cout<<T->data ;
- }
- }
- main()
- {
- char in[MAX+1],post[MAX+1];
- cout<<"输入中序序列:";
- cin>>in;
- cout<<"输入后序序列:";
- cin>>post;
- bt T;
- int len_in=strlen(in),len_post=strlen(post);
- if(len_in<=MAX&&len_post<=MAX)
- in_post_to_bt(in,post,len_in,T);
- cout<<endl<<"输出中序序列:";
- in_visit(T);
- cout<<endl<<"输出后序序列:";
- post_visit(T);
- cout<<endl;
- }
原文地址:http://blog.csdn.net/wuchuanpingstone/article/details/6860453