Check out example codes for "TreeMap lowerEntry(K key) method in java". It will help you in understanding the concepts better.

Code Example 1

import java.util.Map;
import java.util.TreeMap;
public class TreeMapLowerEntryMethodExample
{
   public static void main(String[] args)
   {
      try
      {
         TreeMap<Integer, String> tm = new TreeMap<Integer, String>();
         tm.put(7, "red");
         tm.put(3, "green");
         tm.put(6, "violet");
         tm.put(5, "blue");
         tm.put(4, "yellow");
         System.out.println("Given TreeMap: " + tm);
         // get lowerEntry value for null using lowerEntry() method
         System.out.println("Get lowerEntry value for value null: ");
         Map.Entry<Integer, String> value = tm.lowerEntry(null);
         System.out.println("Value is: " + value);
      }
      catch(NullPointerException ex)
      {
         System.out.println("Exception : " + ex);
      }
   }
}

Code Example 2

import java.util.TreeMap;
public class TreeMapLowerEntryMethodExample
{
   public static void main(String[] args)
   {
      TreeMap<Integer, String> tm = new TreeMap<Integer, String>();
      tm.put(7, "red");
      tm.put(3, "green");
      tm.put(6, "violet");
      tm.put(5, "blue");
      tm.put(4, "yellow");
      // get lower entry
      System.out.println("Check lower entry in given TreeMap");
      System.out.println("Value is: "+ tm.lowerEntry(5));
   }
}

Learn ReactJs, React Native from akashmittal.com