二叉搜索树

二叉搜索树又称二叉排序树。是空树或者具有以下性质的二叉树。
1、若左子树不为空，则左子树上所有结点的值都小于根结点的值。
2、若右子树不为空，则右子树上所有结点的值都大于根结点的值。
3、它的左右子树也分别为二叉搜索树。

public class BSTree {
    public Node root = null;

    //
    public void insert(int key) {//插入
        if (root == null) {
            root = new Node(key);
            return;
        }

        Node parent = null;
        Node current = root;
        while (current != null) {
            if (key == current.key) {
                throw new RuntimeException("key 重复了: " + key);
            } else if (key < current.key) {
                parent = current;
                current = current.left;
            } else {
                parent = current;
                current = current.right;
            }
        }

        // current 就是 key 要插入的位置
        Node node = new Node(key);
        if (key < parent.key) {
            parent.left = node;
        } else {
            parent.right = node;
        }
    }

    // O(树的高度)
    public boolean find(int key) {//查找
        Node current = root;
        while (current != null) {
            if (key == current.key) {
                return true;
            } else if (key < current.key) {
                current = current.left;
            } else {
                current = current.right;
            }
        }

        return false;
    }

    private static void inorder(Node node) {//中序遍历
        if (node != null) {
            inorder(node.left);
            System.out.print(node.key + " ");
            inorder(node.right);
        }
    }

    private static void postorder(Node node) {//后序遍历
        if (node != null) {
            postorder(node.left);
            postorder(node.right);
            System.out.print(node.key + " ");
        }
    }

    public static void main(String[] args) {
        BSTree tree = new BSTree();
        tree.insert(5);
        tree.insert(3);
        tree.insert(8);
        tree.insert(2);
        tree.insert(4);
        tree.insert(7);
        tree.insert(9);
        tree.insert(1);
        tree.insert(6);

        inorder(tree.root);
        System.out.println();
        postorder(tree.root);
        System.out.println();
    }
}