简单二叉树的建立及遍历 Java版

package zsy.com;

import java.util.Scanner;

public class Tree {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Node root = new Node();
		root = initTree();
		preOrder(root);
		System.out.println();
		inOrder(root);
		System.out.println();
		postOrder(root);
	}
	
	public static Node initTree(){
		Node root = new Node();
		Scanner in = new Scanner(System.in);
		System.out.println("请输入节点的值（如果已经是叶子节点，请输入－1）:");
		int fin = in.nextInt();
		if(fin==-1){
			root = null;
		}else{
			root.data = fin;
			root.lchild = initTree();
			root.rchild = initTree();
		}
		return root;
	}
	
	public static void preOrder(Node root){
		if(root!=null){
			System.out.print(root.data);
			preOrder(root.lchild);
			preOrder(root.rchild);
		}
	}
	
	public static void inOrder(Node root){
		if(root!=null){
			inOrder(root.lchild);
			System.out.print(root.data);
			inOrder(root.rchild);
		}
		
	}
	
	public static void postOrder(Node root){
		if(root!=null){
			postOrder(root.lchild);
			postOrder(root.rchild);
			System.out.print(root.data);
		}
	}

}

class Node { 
	Node rchild;
	Node lchild;
	int data;
}

测试用例及结果：