顺序表构造二叉树 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[] array,int i)
{
if(i>array.length-1||array[i] == '#')
return null;
        Node node = new Node();
        node.s = array[i];
node.left = CreateTree(array,2*(i+1)-1);
node.right = CreateTree(array,2*(i+1) );
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[] array = sc.nextLine().toCharArray();


Node node = CreateTree(array,0);
ShowTree(node);



}


}