实现二叉排序树

    二叉排序数又称二叉查找树。它或者是一棵空树，或者是具有下列性质的二叉树：（1）如果左子树不空，那么左子树上所有结点的值均小于它的根结点的值；（2）如果右子树不空，那么右子树所有结点的值均大于它的根结点的值；（3）左、右子树也分别为二叉排序树。

    树的结点定义如下：

public class TreeNode {
	public int data;
	public TreeNode left;
	public TreeNode right;

	public TreeNode(int data) {
		this.data = data;
		this.left = null;
		this.right = null;
	}
}

    建立二叉排序树的过程及其遍历如下：

public class BinarySortedTree {
	private TreeNode root;

	public BinarySortedTree() {
		root = null;
	}

	// 将data插入到排序二叉树中
	public void insert(int data) {
		TreeNode newNode = new TreeNode(data);
		if (root == null) {
			root = newNode;
		} else {
			TreeNode current = root;
			TreeNode parent;
			while (true) { // 寻找插入位置
				parent = current;
				if (data < current.data) {
					current = current.left;
					if (current == null) {
						parent.left = newNode;
						return;
					}
				} else {
					current = current.right;
					if (current == null) {
						parent.right = newNode;
						return;
					}
				}
			}
		}
	}

	// 将数值输入构建二叉树
	public void buildTree(int[] data) {
		for (int i = 0; i < data.length; i++) {
			insert(data[i]);
		}
	}

	// 中序遍历--递归实现
	public void inOrder(TreeNode localRoot) {
		if (localRoot != null) {
			inOrder(localRoot.left);
			System.out.print(localRoot.data + " ");
			inOrder(localRoot.right);
		}
	}

	public void inOrder() {
		this.inOrder(root);
	}

	// 先序遍历--递归实现
	public void preOrder(TreeNode localRoot) {
		if (localRoot != null) {
			System.out.print(localRoot.data + " ");
			preOrder(localRoot.left);
			preOrder(localRoot.right);
		}
	}

	public void preOrder() {
		this.preOrder(root);
	}

	// 后序遍历方法递归实现
	public void postOrder(TreeNode localRoot) {
		if (localRoot != null) {
			postOrder(localRoot.left);
			postOrder(localRoot.right);
			System.out.print(localRoot.data + " ");
		}
	}

	public void postOrder() {
		this.postOrder(root);
	}

	public static void main(String[] args) {
		BinarySortedTree biTree = new BinarySortedTree();
		int[] data = { 2, 8, 7, 4, 9, 3, 1, 6, 7, 5 };
		biTree.buildTree(data);
		System.out.println("二叉排序树的中序遍历为：");
		biTree.inOrder();
		System.out.println();
		System.out.println("二叉排序树的先序遍历为：");
		biTree.preOrder();
		System.out.println();
		System.out.println("二叉排序树的后序遍历为：");
		biTree.postOrder();
		System.out.println();
	}
}

    运行结果：