Too Long; Didn't Read

Graphs model pairwise relationships with vertices and edges. Trees are connected acyclic graphs. DFS explores deeply using a stack, useful for pathfinding and connectivity. BFS explores level by level with a queue, ideal for shortest path and level-order traversal.