It is required to implement a map data structure with the following ch

1.	It is required to implement a map data structure with the following characteristics:It stores (key, value) pairs, and both the key and value are of type StringInserting a new (key, value) pair in the map must have a performance time of O(log n) in the worst caseLooking up a key in the map must have a performance time of O(log n) in the worst caseIt is expected to be a main-memory data structureWhich of the following data structures is most appropriate for this requirement
Answer» ANSWER: TEXT EXPLANATION: because it have most AREA for WORK

It is required to implement a map data structure with the following characteristics:It stores (key, value) pairs, and both the key and value are of type StringInserting a new (key, value) pair in the map must have a performance time of O(log n) in the worst caseLooking up a key in the map must have a performance time of O(log n) in the worst caseIt is expected to be a main-memory data structureWhich of the following data structures is most appropriate for this requirement

Answer»

because it have most AREA for WORK