Data Structures

overview

Remember these Terms

• Array: contiguous indexed collection; O(1) access, expensive middle inserts.
• Linked List: nodes linked by pointers; easy inserts, slow random access.
• Stack: LIFO; push/pop at top; supports undo and recursion.
• Queue: FIFO; enqueue/dequeue ends; models buffering and scheduling.
• Hash Table: hash keys to buckets; average O(1) lookup; handle collisions.
• Tree: hierarchical nodes; traversals (DFS/BFS) enable searches.
• Heap: partial order; efficient min/max retrieval; powers priority queues.
• Graph: nodes and edges model relationships; traversals find paths.