Array
Contiguous indexed collection of elements.
Public flashcard set
Data Structures 101
Foundational structures for CS students.
it cs student
Flashcards
Linked list
Nodes connected by pointers/references.
Stack
LIFO structure (last in, first out).
Queue
FIFO structure (first in, first out).
Hash table
Key → value lookup via a hash function.
Binary tree
Tree where each node has ≤2 children.
BST
Binary search tree ordered for fast search.
Heap
Tree-based structure for priority queues.
Graph
Nodes (vertices) connected by edges.
DFS
Depth-first search traversal.
BFS
Breadth-first search traversal.
Big O
Notation describing asymptotic complexity.
Recursion
Function that calls itself with a base case.
Algorithm
Step-by-step procedure to solve a problem.