JAVA PROGRAM • LEVEL 13 — COLLECTIONS & GENERICS
Navigate Sorted Map Keys in Java
Learn navigate sorted map keys in java with a complete, compiler-ready Java 17 example.
PROBLEM UNDERSTANDING
Input and expected output
No input required
70 95 95
COMPLETE JAVA 17 PROGRAM
Complete Java 17 implementation
import java.util.*;
class Main {
public static void main(String[] args) throws Exception {
TreeMap<Integer,String> marks=new TreeMap<>();marks.put(80,"B");marks.put(95,"A+");marks.put(70,"C");
System.out.println(marks.firstKey()+" "+marks.lastKey()+" "+marks.ceilingKey(82));
}
}CURRENT STEP
Select Start to walk through the important lines.
SELECTED LINE
No line selected
EXPECTED OUTPUT FOR THE SAMPLE
70 95 95
PROGRAM EXPLANATION
Algorithm and explanation
- Initialize the deterministic sample values used for navigate sorted map keys in java.
- Create the required object and apply TreeMap and NavigableMap to its state or behavior.
- Print the final result and compare it with the documented sample output.
This Java 17 example demonstrates TreeMap and NavigableMap through a complete, executable program. The values are intentionally small so students can trace each statement, verify the output, and then modify the example safely in the online compiler.
EFFICIENCY
Time and space complexity
O(n log n)
O(n)
DEBUGGING CHECKLIST
Common mistakes
Keep the class name Main and the entry method signature public static void main(String[] args) when using the online compiler.
Use TreeMap with compatible Java types; Java checks types and method signatures at compile time.
Java is case-sensitive, and every statement that requires a semicolon must end with one.