Method findBiggestEntry

vm/JavaAPI/src/java/util/TreeMap.java:3946–3955

()

    }

    TreeMap.Entry<K, V> findBiggestEntry() {
        if (null != root){
            Node<K, V> node = maximum(root);
            TreeMap.Entry<K, V> ret = new TreeMap.Entry<K, V>(node.keys[node.right_idx], node.values[node.right_idx]);
            ret.node = node;
            ret.index = node.right_idx;
            return ret;
        }
        return null;
    }

    TreeMap.Entry<K, V> findCeilingEntry(K key) {
        if (root == null) {