由中序后序构建二叉树 Java实现

package fenshujs;


import java.util.Scanner;


public class bishi {
private static class Node
{
public char s;
public Node left = null;
public Node right = null;
}
public static Node CreateTree(char[] post,char[] in,int preleft,int preright,int inleft,int inright)
{
// System.out.println(preleft+" "+preright+" "+inleft+" "+inright);
if(preleft>preright)
return null;
Node node = new Node();
node.s = post[preright];
if(preleft==preright)
return node;
int inroot = 0,flag = -1;
for(int i = inleft;i<=inright;i++)
{
if(in[i] == node.s)
{
inroot = i;
flag = 0;
break;
}

}
        if(-1 == flag)
        {
        return null;
        }
// inroot = pre.length - inroot - 1;
node.left = CreateTree(post,in,preleft,preleft+(inroot-inleft-1),inleft,inroot-1);
node.right = CreateTree(post,in,preleft+(inroot-inleft) ,preright-1,inroot+1 ,inright);
return node;
}
public static void ShowTree(Node node)
{
if(node == null)
return;
System.out.print("[");
ShowTree(node.left);
System.out.print(node.s);
ShowTree(node.right);
System.out.print("]");
}
public static void main(String[] args){
   
Scanner sc = new Scanner(System.in);
char[] post = sc.nextLine().toCharArray();
char[] in = sc.nextLine().toCharArray();
// Node node = CreateTree(pre,in,0,pre.length-1,0,in.length-1);
Node node = CreateTree(post,in,0,post.length-1,0,in.length-1);
ShowTree(node);



}


}