[알고리즘] TreeMap

특징: redblack tree 기반

 

ceilingEntry: O(logn)

ceilingKey: O(logn)

clear: O(n)

containsKey: O(logn)

containsValue: O(logn)

entrySet: O(n)

firstEntry: O(logn)

firstKey: O(logn)

floorEntry: O(logn)

floorKey: O(logn)

get: O(logn)

higherEntry: O(logn)

higherKey: O(logn)

keySet: O(n)

lastEntry: O(logn)

lastKey: O(logn)
lowerEntry: O(logn)

lowerKey: O(logn)
pollFirstEntry: O(logn)

pollLastEntry: O(logn)

put: O(logn)

putAll: O(mlogn)

remove: O(logn)
replace: O(logn)

replaceAll: O(mlogn)

size: O(1)