Hashmaps vs storing data in the tree

Fragment of a discussion from User talk:AW/kD-Tree
Jump to navigation Jump to search

O, looks like i misunderstand you. Do you mean why HashMap is faster than TreeMap? I'm not sure but i think, that hash map has efficiency O(1) but tree map O(log N) because tree map are sorted and based on red-black tree. I do not describe how they works because my english skill...

Jdev‎20:39, 25 July 2012
Retrieved from "http://robowiki.net/wiki/Thread:User_talk:AW/kD-Tree/Hashmaps_vs_storing_data_in_the_tree/reply_(2)#Hashmaps_vs_storing_data_in_the_tree_1355"