二叉树和中序遍历

package com.Tree;

public class TreeManager {
	private Node root;

	public void add(int data) {
		if (root == null) {
			root = new Node(data);
		} else {
			root.addNode(data);
		}
	}

	public void print() {
		if (root != null) {
			root.printNode();
		} else {
			System.out.println("null!");
		}
	}

	private class Node {
		private int data;
		private Node left;
		private Node right;

		/**
		 * @param data
		 */
		public Node(int data) {
			super();
			this.data = data;
		}

		public void addNode(int data) {
			if (this.data > data) {
				if (this.left == null) {
					this.left = new Node(data);
				} else {
					this.left.addNode(data);
				}
			} else {
				if (this.right == null) {
					this.right = new Node(data);
				} else {
					this.right.addNode(data);
				}

			}

		}

		public void printNode() {
			if (this.left != null) {
				this.left.printNode();
			}
			System.out.println(this.data);
			if (this.right != null) {
				this.right.printNode();
			}

		}
	}

}