Question
** Please help me out, I'm trying to study for my final and this question is a practice example to prepare myself for the final **
Briefly describe two possible internal representations one might use for the Java Map interface For each one, give the big-O time to do each of the Map operations listed below. For full credit, one of the representations must be different than the ones already provided in the Java library. returns true iff entry with the key key' is in the map public boolean contains Key (KeyType key get the value associated with this key if no entry with this key exists, returns null public ValueType get (KeyType key) inserts an entry or updates the value that goes with an existing key. Returns the old value associated with the key, or null if this key was not previously in the map public ValueType put (KeyType key ValueType value remove the entry with this key returns the associated value or null if not found public ValueType remove (KeyType key) Description of representation 1 Big-O times for representation i: Key get contains put remove Description of representation 2 Big-O times for representation 2: containsKey get put remove
Explanation / Answer
it print 1->2->3->1->2->3->1->2->3-> and so on. its a circular Link list
