TreeMap class in collection framework

TreeMap class

  • A TreeMap contains values based on the key. It implements the NavigableMap interface and extends AbstractMap class.
  • It contains only unique elements.
  • It cannot have null key but can have multiple null values.
  • It is same as HashMap instead maintains ascending order.
The TreeMap class implements the Map interface by using a tree. A TreeMap provides an efficient means of storing key/value pairs in sorted order, and allows rapid retrieval.

You should note that, unlike a hash map, a tree map guarantees that its elements will be sorted in ascending key order.

The TreeMap class supports four constructors. The first form constructs an empty tree map that will be sorted by using the natural order of its keys:
TreeMap( )
The second form constructs an empty tree-based map that will be sorted by using the Comparator comp:
TreeMap(Comparator comp)
The third form initializes a tree map with the entries from m, which will be sorted by using the natural order of the keys:
TreeMap(Map m)
The fourth form initializes a tree map with the entries from sm, which will be sorted in the same order as sm:
TreeMap(SortedMap sm)
Apart from the methods inherited from its parent classes, TreeMap defines following methods:
SNMethods with Description
1void clear()
Removes all mappings from this TreeMap.
2Object clone()
Returns a shallow copy of this TreeMap instance.
3Comparator comparator()
Returns the comparator used to order this map, or null if this map uses its keys' natural order.
4boolean containsKey(Object key)
Returns true if this map contains a mapping for the specified key.
5boolean containsValue(Object value) 
Returns true if this map maps one or more keys to the specified value.
6Set entrySet() 
Returns a set view of the mappings contained in this map.
7Object firstKey() 
Returns the first (lowest) key currently in this sorted map.
8Object get(Object key) 
Returns the value to which this map maps the specified key.
9SortedMap headMap(Object toKey) 
Returns a view of the portion of this map whose keys are strictly less than toKey.
10Set keySet()
Returns a Set view of the keys contained in this map.
11Object lastKey() 
Returns the last (highest) key currently in this sorted map.
12Object put(Object key, Object value) 
Associates the specified value with the specified key in this map.
13void putAll(Map map) 
Copies all of the mappings from the specified map to this map.
14Object remove(Object key) 
Removes the mapping for this key from this TreeMap if present.
15int size() 
Returns the number of key-value mappings in this map.
16SortedMap subMap(Object fromKey, Object toKey) 
Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
17SortedMap tailMap(Object fromKey) 
Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
18Collection values() 
Returns a collection view of the values contained in this map.

import java.util.*;
class TreeMapDemo
 public static void main(String args[])
  TreeMap< String,Integer> tm = new TreeMap< String,Integer>();
  tm.put("a",new Integer(100));
  tm.put("b",new Integer(200));
  tm.put("c",new Integer(300));
  tm.put("d",new Integer(400));

  Set< Map.Entry< String,Integer> > st = tm.entrySet();
  for(Map.Entry me:st)  

a 100
b 200
c 300
d 400

<<Previous <<   || Index ||   >>Next >>

No comments:

Post a Comment