### Question:
TreeMap extends AbstractSortedMap<K, V> { @Override public Entry<K, V> ceilingEntry(K key) throws IllegalArgumentException { return null; } TreeMap();  TreeMap(Comparator<K> comp); @Override int size(); @Override V get(K key); @Override V put(K key, V value); @Override V remove(K key); @Override Entry<K, V> firstEntry(); @Override Entry<K, V> lastEntry(); @Override Entry<K, V> ceilingEntry(K key); @Override Entry<K, V> floorEntry(K key); @Override Entry<K, V> lowerEntry(K key); @Override Entry<K, V> higherEntry(K key); @Override Iterable<Entry<K, V>> entrySet(); @Override Iterable<Entry<K, V>> subMap(K fromKey, K toKey); static void main(String[] args);  }### Answer:
@Test void testCeilingEntry() { TreeMap<Integer, String> map = new TreeMap<>(); Integer[] arr = new Integer[] {35,26,15,24,33,4,12,1,23,21,2,5}; for(Integer i : arr) { map.put(i, Integer.toString(i)); } assertEquals(12, map.ceilingEntry(11).getKey()); assertEquals(2, map.ceilingEntry(2).getKey()); }