用java 写一个二叉树算法

以下是一个Java实现的二叉树算法：

public class BinaryTree {

    private Node root;

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

        Node(int value) {
            this.value = value;
            left = null;
            right = null;
        }
    }

    public void insert(int value) {
        root = insert(root, value);
    }

    private Node insert(Node node, int value) {
        if (node == null) {
            node = new Node(value);
        } else {
            if (value <= node.value) {
                node.left = insert(node.left, value);
            } else {
                node.right = insert(node.right, value);
            }
        }
        return node;
    }

    public void inorder() {
        inorder(root);
    }

    private void inorder(Node node) {
        if (node != null) {
            inorder(node.left);
            System.out.print(node.value + " ");
            inorder(node.right);
        }
    }

    public boolean search(int value) {
        return search(root, value);
    }

    private boolean search(Node node, int value) {
        if (node == null) {
            return false;
        } else if (node.value == value) {
            return true;
        } else if (value < node.value) {
            return search(node.left, value);
        } else {
            return search(node.right, value);
        }
    }

    public int height() {
        return height(root);
    }

    private int height(Node node) {
        if (node == null) {
            return -1;
        } else {
            int leftHeight = height(node.left);
            int rightHeight = height(node.right);
            return Math.max(leftHeight, rightHeight) + 1;
        }
    }
}

该算法实现了以下功能：

1. 插入一个值到二叉树中
2. 中序遍历二叉树
3. 搜索一个值是否在二叉树中存在
4. 计算二叉树的高度

这个算法可以通过以下方式使用：

BinaryTree binaryTree = new BinaryTree();
binaryTree.insert(5);
binaryTree.insert(3);
binaryTree.insert(7);
binaryTree.insert(1);
binaryTree.insert(4);
binaryTree.insert(6);
binaryTree.insert(8);

System.out.print("Inorder traversal: ");
binaryTree.inorder(); // 输出: 1 3 4 5 6 7 8

System.out.println();
System.out.println("Is 3 in the tree? " + binaryTree.search(3)); // 输出: true
System.out.println("Is 10 in the tree? " + binaryTree.search(10)); // 输出: false

System.out.println("Height of the tree: " + binaryTree.height()); // 输出: 2
``