package Tree;

public class Main {

	public static void main(String[] args) {
		Node D = new Node("D", null, null);
		Node G = new Node("G", null, null);
		Node F = new Node("F", null, null);
		Node K = new Node("K", null, null);
		Node B = new Node("B", D, G);
		Node E = new Node("E", F, K);
		Node A = new Node("A", B, E);
		inOrder(A);
	}

	//ǰ
	public static void perOrder(Node N) {
		if (N == null) {
			return;
		}
		System.out.print(N.data);
		perOrder(N.left);
		perOrder(N.right);
	}
	//
		public static void inOrder(Node N) {
			if (N == null) {
				return;
			}
			perOrder(N.left);
			System.out.print(N.data);
			perOrder(N.right);
		}
		//
				public static void afOrder(Node N) {
					if (N == null) {
						return;
					}
					perOrder(N.left);
					perOrder(N.right);
					System.out.print(N.data);
				}
}