Java Exercises

Java Collection, TreeMap Exercises: Get the portion of a map whose keys are strictly less than a given key

Java Collection, TreeMap Exercises: Exercise-13 with Solution

Write a Java program to get the portion of a map whose keys are strictly less than a given key.

Sample Solution:-

Java Code:

import java.util.*;
import java.util.Map.Entry;  
public class Example13 {  
       public static void main(String args[]) {

  // Create a tree map
  TreeMap < Integer, String > tree_map1 = new TreeMap < Integer, String > ();

  // Put elements to the map 
  tree_map1.put(10, "Red");
  tree_map1.put(20, "Green");
  tree_map1.put(40, "Black");
  tree_map1.put(50, "White");
  tree_map1.put(60, "Pink");

  System.out.println("Orginal TreeMap content: " + tree_map1);
  System.out.println("Checking the entry for 10: ");
  System.out.println("Key(s): " + tree_map1.headMap(10));
  System.out.println("Checking the entry for 30: ");
  System.out.println("Key(s): " + tree_map1.headMap(30));
  System.out.println("Checking the entry for 70: ");
  System.out.println("Key(s): " + tree_map1.headMap(70));

Sample Output:

Orginal TreeMap content: {10=Red, 20=Green, 40=Black, 50=White, 60=Pink
Checking the entry for 10:                                             
Key(s): {}                                                             
Checking the entry for 30:                                             
Key(s): {10=Red, 20=Green}                                             
Checking the entry for 70:                                             
Key(s): {10=Red, 20=Green, 40=Black, 50=White, 60=Pink}

Java Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?