|
Java™
by example!
|
|
|
What is a TreeMap and how do I use one in Java?
A TreeMap maintains key/value objects in sorted order by using a balanced red-black tree. A red-black tree is a balanced binary tree, meaning a parent node has maximum 2 children and as an entry is inserted, the tree is monitored as to keep it well-balanced. For more information about red-black trees, check out the sites below!
Keeping the binary tree balanced ensures the fast insertion, removal and lookup time of O(log n). Not as fast as a HashMap which is O(constant), but remember that the TreeMap has the advantage that the keys are in sorted order which opens up a lot of other capabilities.
Following example shows most of the useful methods in TreeMap.
Main.java:
outputs:
Further Information
Author of answer: Joris Van den Bogaert
Comments to this answer are only viewable by members. Login or become a member!
|
|
|
|
|
In-house 
