3- Dynamic Data Structures

Arrays

• Fast look up

• Minimal overhead

• Cannot grow or shrink after creation

• Deleting/inserting requires shifting

Linked Lists

• Slower look up

• A chain of nodes connetced by pointers

• grow and shrinks easily

• inserton and deletion requires changing the nodes next pointers

Pointers

• Pointer is a varibale that stroes a memory address

• Can point to shared data without making copies

• Null pointer points to nothing