Dynamic Data Structures

• Arrays have limits (fixed size, fixed memory, etc.)

• One way we can counter this limitation is to copy our data into a new, bigger array when we need more space

• Using the length property of the too small array, we can make a new array bigger and better than that old stupid one

• Link list or “nodes” Lightning strikes in the distance

• You can add to the end, remove from wherever, and a whole bunch of stuff

• Way more versatile than an array

• There’s double link list is where where you can go either way

• index’s are different than like the actual slots cuz they start at 0 ()