Breadth First Search (BFS) vs Depth First Search (DFS) for Graphs!

preview_player
Показать описание
FAANG Coding Interviews / Data Structures and Algorithms / Leetcode
Рекомендации по теме
Комментарии
Автор

Master Data Structures & Algorithms For FREE at AlgoMap.io!

GregHogg
Автор

Think about it this way: What has depth - something vertical so you want a stack, what has breadth - something horizontal so you want a queue. Up an Down vs Left to Right if this helps anyone, it helped me so just offering it up.

askholia
Автор

I’m not even kidding, this is the most straightforward explanation I’ve ever heard on bfs vs dfs

modernmaiar
Автор

You literally explained more in 30 seconds than my entire lecture did in like an hour

eric
Автор

Man please never ever stop making videos, keep up the good work

ZillasWay
Автор

Hey your videos are Fabolous...
Daily can you solve one leetcode problem
Based on topics like array, linked list like this and famous algo

Sujith_sundar
Автор

Could you do a more complicated example? I keep failing my Algorithm & Data Structures exam but I'm not sure how I'm applying DFS and BFS incorrectly. The problems there are usually geometric shapes like diamonds, or the outline of a plane rather than simple things like this.😊

loandbaxhuku
Автор

So you used a depth first numbering system

forgottenfamily
Автор

What site are u using in your videos, like with the coding questions

damand