Usage in graph algorithms: DFS uses a Stack; BFS uses a Queue → see L13 Graph Traversal
Monotonic Stack application → see misc
Stacks and Queues are typically implemented using arrays or linked lists → see L5 Lists
Usage in graph algorithms: DFS uses a Stack; BFS uses a Queue → see L13 Graph Traversal
Monotonic Stack application → see misc
Stacks and Queues are typically implemented using arrays or linked lists → see L5 Lists