Depth-First Search — explores branches deeply before backtracking
Breadth-First Search — explores all neighbors before moving to next level
Dijkstra's Algorithm — finds shortest paths from source to all nodes
Binary Search Tree — shows insertion operations in a sorted tree
Prim's MST — builds minimum spanning tree by adding minimum weight edges
Quick Sort — divide-and-conquer sorting with pivot partitioning