I know in O(logn) time we can achieve get() for a red-black tree, but if we have a HashMap in the implementation of treeMap, we can always achieve containsKey() and get() in O(1) time.
Are we doing it in Java or other language’s treemap implementation? if not, why?
search online but no same ask or answer found
3
I know in O(logn) time we can achieve get() for a red-black tree, but if we have a HashMap in the implementation of treeMap, we can always achieve containsKey() and get() in O(1) time.
Are we doing it in Java or other language’s treemap implementation? if not, why?
search online but no same ask or answer found
3
