TreeMap

i would liek to know about TreeMap .

I read TreeMap

 based on the Red-Black tree data structure.


I a=was not clear on that. When, how , where we use it and we implememnt it.

Thanks in advance
LVL 7
gudii9Asked:
Who is Participating?

Improve company productivity with a Business Account.Sign Up

x
 
for_yanConnect With a Mentor Commented:

http://www.jguru.com/faq/view.jsp?EID=981


Answer
A red-black tree is a binary search tree where every node has two children or is a leaf. It ensures O(log N) search times, at a cost of a more complicated insertion (and deletion) process. In a red-black tree, every node is colored either red or black, with a black root node, though a black root node isn't a requirement. In addition, if a node is red, its children must be black and every path from root to leaf (or null child node) must contain the same number of black nodes. These rather obscure rules ensure the tree is balanced.


0
 
rumi78Connect With a Mentor Commented:
TreeMap is Map implementation.

You use it when you want to have values ordered by key.

It means, when you iteratate map.values() it will be ordered.

rgds
rumi
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.