PTA 建立与遍历二叉树 java

package pat树;

import java.util.Scanner;

public class Main75建立与遍历二叉树 {
    static String s;
    static node root;
    static int i;
    static char a;
    
    public static node build() {
    	a=s.charAt(i++);
    	node jiedian=new node();
    	if(a!='#') {
    		jiedian.v=a;
    		jiedian.le=build();
    		jiedian.ri=build();	
    	}
    	else {
    		jiedian=null;
    	}
    	return jiedian;
    }
    public static void print(node root) {
    	if(root!=null) {
    		print(root.le);
    		System.out.print(root.v);
    		print(root.ri);
    	}
    }
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		s=in.nextLine();
		root=build();
        print(root);
	}

}
class node{
	char v;
	node le;
	node ri;
}