藏得很深的八阿哥

在由二叉树后序遍历和中序遍历获得层次遍历的下列代码中，有一个隐藏得很深的八阿哥。

#include <bits/stdc++.h>
using namespace std;

map<int,char> m;

void buildTree(string back,int la,int ra,string mid,int lb,int rb,int father,bool is_left){
	if(la>ra || lb>rb)
		return;
	if(is_left)
		m[2*father+1] = back[ra];
	else
		m[2*father+2] = back[ra];
	int pos = 0;
	for(int i=lb;i<=rb;i++){
		if(mid[i]==back[ra]){
			pos = i;
			break;
		}
	}
	buildTree(back,la,la-lb+pos-1,mid,lb,pos-1,2*father+1,true);
	buildTree(back,la-lb+pos,ra-1,mid,pos+1,rb,2*father+2,false);
}

int main(){
	string back,mid;
	while(cin>>back>>mid){
		m.clear();
		int blen = (int)back.length();
		int mlen = (int)mid.length();
		m[0] = back[blen-1];
		int pos = 0;
		for(int i=0;i<mlen;i++){
			if(mid[i]==m[0]){
				pos = i;
				break;
			}
		}
		buildTree(back,0,pos-1,mid,0,pos-1,0,true);
		buildTree(back,pos,blen-2,mid,pos+1,mlen-1,0,false);
		for(map<int,char>::iterator it=m.begin();it!=m.end();it++)
			cout<<it->second;
	}
}

问题出在这一块

    buildTree(back,la,la-lb+pos-1,mid,lb,pos-1,2*father+1,true);
	buildTree(back,la-lb+pos,ra-1,mid,pos+1,rb,2*father+2,false);

由于左子树序号是2father+1，而右子树序号是2father+2，所以非常容易陷入思维定式，不假思索得将递归下一层左子树父节点设为2father+1，右子树父节点设为2father+2。实际上，左右子树的父节点都是相同的，是左右子节点不同。所以要做如下修改：

if(is_left){
		buildTree(back,la,la-lb+pos-1,mid,lb,pos-1,2*father+1,true);
		buildTree(back,la-lb+pos,ra-1,mid,pos+1,rb,2*father+1,false);
	}
	else{
		buildTree(back,la,la-lb+pos-1,mid,lb,pos-1,2*father+2,true);
	    buildTree(back,la-lb+pos,ra-1,mid,pos+1,rb,2*father+2,false);
	}