Day 3 — Lists/Arrays, Hash Tables, Sets Review

Circular linked list - Last node links back to the first node, useful for modeling repeating processes

Dummy node - Eliminates the need to handle special cases for the head node in a linked list

Array based list insertion - Shifts all elements after the insertion point one step to the right

Dynamic array - Expands automatically to fit new elements, unlike a fixed size static array

Hash table storage - Places each item into a bucket determined by a hash function of its key

Hash table average case insert or lookup - O(1)

Dictionary required components - Key and value

Positional list - Nodes store links to previous and next neighbors so inserting at a position only needs pointer updates

Doubly linked list deletion - Update the neighboring nodes pointers to skip the removed node

Set add duplicate - Nothing changes if the element is already in the set

List versus tuple - A list can be modified after creation, a tuple cannot

Overloaded methods - Same name, different parameter lists, they compile fi