Describe the difference between a java.util.HashMap and a java.util.TreeMap. h
O The TreeMap class is efficient for locating a value, inserting an entry, and deleting an entry. The HashMap class is efficient for traversing the keys in a sorted order.
O The HashMap has a linked-list implementation that supports an ordering of the entries in the map. The TreeMap class is efficient for traversing the keys in a sorted order.
O The TreeMap has a linked-list implementation that supports an ordering of the entries in the map. The HashMap class is efficient for traversing the keys in a sorted order.
O The HashMap class is efficient for locating a value, inserting an entry, and deleting an entry. The TreeMap class is efficient for traversing the keys in a sorted order.
