由前序和中序遍历得到后序遍历

#include<bits/stdc++.h>
using namespace std;
void last(char front[],int f_left,int f_right,char mid[],int m_left,int m_right);
int main(){
	char a[20]="GDAFEMHZ";
	char b[20]="ADEFGHMZ";
	last(a,0,7,b,0,7);
	return 0;
}

void last(char front[],int f_left,int f_right,char mid[],int m_left,int m_right){
	if(f_left>f_right)
	return;
	char tag = front[f_left];
	int i=m_left;
	int n=0;
	while(mid[i] != tag && i<=m_right){
		i++;
		n++;
	}
	last(front,f_left+1,f_left+n,mid,f_left,i-1);
	last(front,f_left+n+1,f_right,mid,i+1,m_right);
	cout<<tag;
}