- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search ♣
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Graph Traversal / Breadth First Search »
Bread First Search is using queue, not recursion. When we want to stay close, we use Breadh First Search. When we want to move far away quickly, we use DFS.
Which data structure uses BFS for traverse? When we want to stay close to the starting point, what do we use? When we want to move far away quickly, what do we use?
Click to Flip Card
