The keySet() method of SortedMap Interface in Java is used to create a set out of the key elements contained in the treemap. It basically returns a set view of the keys or we can create a new set and store the key elements in them in an ascending order. Since the set is backed by the map, any changes made to the map are reflected in the set, and vice-versa.
Parameters: The method does not take any parameter.
Return Value: The method returns a set having the keys of the treemap in ascending order.
Below programs are used to illustrate the working of the above method:
Program 1: Mapping String Values to Integer Keys.
Program 2: Mapping Integer Values to String Keys.
Note: The same operation can be performed with any type of Mappings with variation and combination of different data types.
- SortedMap entrySet() method in Java with Examples
- SortedMap comparator() method in Java with Examples
- SortedMap values() method in Java with Examples
- Map keySet() Method in Java with Examples
- Properties keySet() method in Java with Examples
- ConcurrentHashMap keySet() method in Java with Examples
- AbstractMap keySet() Method in Java with Examples
- Provider keySet() method in Java with Examples
- SortedMap Interface in Java with Examples
- SortedMap subMap() method in Java
- SortedMap lastKey() method in Java
- SortedMap headMap() method in Java
- SortedMap firstKey() method in Java
- SortedMap tailMap() method in Java
- Hashmap methods in Java with Examples | Set 2 (keySet(), values(), containsKey()..)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.