What is the worst-case execution time of the get(key) method for a key that is not in the HashMap?

O(n), where n is the number of elements in the HashMap. In the worst case, with a large number of collisions, all elements may end up in a single "bucket", and searching for a non-existent key will require traversing the entire linked data structure (e.g., LinkedList).