def llist_insert(head, name, phone): current = head while current is not None: if current['name'] == name: current['phone'] = phone return head current = current['next'] new_node = {'name': name, 'phone': phone, 'next': None} if head is None: return new_node current = head while current['next'] is not None: current = current['next'] current['next'] = new_node return head def llist_find(head, name): current = head while current is not None: if current['name'] == name: return current['phone'] current = current['next'] return None def llist_delete(head, name): if head is None: return None if head['name'] == name: return head['next'] prev = head current = head['next'] while current is not None: if current['name'] == name: prev['next'] = current['next'] return head prev = current current = current['next'] return head def llist_get_all(head): entries = [] current = head while current is not None: entries.append((current['name'], current['phone'])) current = current['next'] entries.sort(key=lambda x: x[0]) return entries BUCKET_SIZE = 1000 def ht_create(): return [None] * BUCKET_SIZE def ht_insert(table, name, phone): idx = hash(name) % len(table) table[idx] = llist_insert(table[idx], name, phone) return table def ht_find(table, name): idx = hash(name) % len(table) return llist_find(table[idx], name) def ht_delete(table, name): idx = hash(name) % len(table) table[idx] = llist_delete(table[idx], name) return table def ht_get_all(table): all_entries = [] for head in table: current = head while current is not None: all_entries.append((current['name'], current['phone'])) current = current['next'] all_entries.sort(key=lambda x: x[0]) return all_entries if __name__ == '__main__': table = ht_create() ht_insert(table, "Alice", "111-222") ht_insert(table, "Bob", "333-444") ht_insert(table, "Alice", "555-666") print(ht_find(table, "Alice")) print(ht_find(table, "Bob")) print(ht_find(table, "Charlie")) ht_delete(table, "Bob") print(ht_get_all(table))