Get Higher Key from NavigableMap in Java

Getting higher key means to return the least key strictly greater than the given key. This is done using higherKey() method in Java.

The following is an example.

Example

 Live Demo

import java.util.*;
public class Demo {
   public static void main(String[] args) {
      NavigableMap<Integer, String> n = new TreeMap<Integer, String>();
      n.put(5, "Tom");
      n.put(9, "John");
      n.put(14, "Jamie");
      n.put(1, "Tim");
      n.put(4, "Jackie");
      n.put(15, "Kurt");
      n.put(19, "Tiger");
      n.put(24, "Jacob");
      System.out.println("NavigableMap elements...\n"+n);
      System.out.println("Higher Key = "+n.higherKey(15));
   }
}

Output

NavigableMap elements...
{1=Tim, 4=Jackie, 5=Tom, 9=John, 14=Jamie, 15=Kurt, 19=Tiger, 24=Jacob}
Higher Key = 19