Method minimum

vm/JavaAPI/src/java/util/TreeMap.java:4356–4361

(Entry<K, V> x)

    }

    static <K, V> Entry<K, V> minimum(Entry<K, V> x) {
        while (x.left != null) {
            x = x.left;
        }
        return x;
    }

    static <K, V> Entry<K, V> predecessor(Entry<K, V> x) {
        if (x.left != null) {