Method findSmallestEntry

vm/JavaAPI/src/java/util/TreeMap.java:3935–3944

()

    }

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

    TreeMap.Entry<K, V> findBiggestEntry() {
        if (null != root){