二分搜索树的查找

查找最大键值

// 寻找二分搜索树中的最小键值
public Key minimun() {
    assert count != 0;
    Node minNode = minimun(root);
    return minNode.key;
}
private Node minimun(Node node) {
    if (node.left == null) {
        return node;
    }
    return minimun(node.left);
}

查找最小键值

// 寻找二分搜索树中的最小键值
public Key minimun() {
    assert count != 0;
    Node minNode = minimun(root);
    return minNode.key;
}
private Node minimun(Node node) {
    if (node.left == null) {
        return node;
    }
    return minimun(node.left);
}