【java】二叉树重建

输入二叉树的后序遍历和中序遍历，输出它的先序遍历。

样例输入：

ACBFGED ABCDEFG

CDAB CBAD

样例输出：

DBACEGF

BCAD

import java.util.Scanner;
public class Main {
	public static StringBuffer str=new StringBuffer();
	public static void buildTree(String s1,String s2){
		if(s1.length()<=0)
			return;
		char c=s1.charAt(s1.length()-1);
		int index=s2.indexOf(c);
		str.append(c);
		buildTree(s1.substring(0,index),s2.substring(0,index));
		buildTree(s1.substring(index,s1.length()-1),s2.substring(index+1));
	}
	public static void main(String[] args){
		Scanner scanner = new Scanner(System.in);
		while(scanner.hasNext())
		{
			String s1=scanner.nextLine();
			String s2=scanner.nextLine();
			str.setLength(0);
			buildTree(s1,s2);
			System.out.println(str.toString());
		}
		scanner.close();
	}

}