BFS DFS - Simplified

[@Genivaldo_Gueiros]

Thanks a lot. It was the best material I found about the topic!

[@roshansah5155]

Sir now where r u..

[@PositiveZahid]

Excellent example and comparison i have ever seen. Thanks for this excellent video discussion.

[@sinto4105]

at 3:10 he forgets to add 9 I think

[@hamzashamshad4689]

Nice explanation... made me clear about different outcomes of BFS and DFS, may Allah bless u!

[@mounikareddy3896]

you have explained it good but you have forgotten the element 9 in the traversal

[@aishwaryakadam956]

please join our university.... we really need professor like you

[@raghavgupta6536]

+1

[@molyoxide8358]

he's already present in KZbin University.

[@AadeshGhimire-d7f]

missed 9 in 1st qn?

[@mohitpawar10]

Their is mistake in bfs. You did not visited 9 in bfs.

[@aaminashaikh778]

mohit pawar yes, not visited 9

[@singh_gurjyot]

doesn't matters, because only 3 is adjacent to it, which has already been visited

[@TheRight_wingGuy]

It's already visited

[@ItachiUchiha-ub2iu]

DFS is a graph traversal technique which use 'back tracking' method to visit it previous node.

[@utsavthakur8566]

In the BFS example, why is 9 not in the queue?

[@pratibhasingh8999]

Thank you so much sir for clear explanation

[@languageofuniverse]

very delicious leacture ty...

[@sohamchoulwar1700]

Bro, what??

[@GyaaniUser]

Sir ur videos are so helpful throughout the semester. Leraned alot from series of videos.Thank you so much. Sir, plz also consider the Amortized Analysis Chapter and make videos for that also.

[@sinto4105]

at 3:10 he forgets to add 9 I think

[@sagarjain4128]

@@sinto4105 Yes, He forgot

[@amu3427]

Thanks. It was very useful👌👌

[@sinto4105]

at 3:10 he forgets to add 9 I think

[@vimeshguna7097]

Best explaination

[@jyothikoushik8121]

Sir should I consider the alphabetical order.. Only?!

[@ALESSIACATTANEO-f5o]

4:55 you forgot 9 in the queue. Anyway great content!

[@lozanhalabi6721]

you are the best ever !

[@Amitsa299]

first time i understand it properly

[@jeffinsvarghese8907]

There's a mistake. You did not add 9to the queue

[@Chetan.Kothari]

Thank you so much!!!

[@ItachiUchiha-ub2iu]

Are vertex and node same term in graph?

[@harshsharma2505]

awesome explanation

[@ahsanraju1]

Good lecture

[@hackerstube2739]

Love you man! Just before xam 😊😊😊😊u killed it

[@RohitKumar-zp6ci]

At 3:28 why didn't we put 9 in the queue?

[@c.danielpremkumar8495]

Before starting the 'search', how is the Graph represented for enabling the searching operation ?

[@darXer0]

Adjacency Matrix bantaa hai.

[@AkshayKumar-dl1km]

Sir in bfs spanning tree 4 is not connected to 3...???

[@zarwabutt4661]

addition to not visiting vertex 9, when u made spinning tree, i could not understand....where was the relation between 3 and 4 ? plz answer so that i could overcome my confusion ..

[@zarwabutt4661]

sure sir.... its 5:19 ... when we made graph, we see it have a relation b/w 3 and 4 ...but when we made the tree ... what would become of that.... this was the bit of a confusion .... :)

[@zarwabutt4661]

thanks alot sir for help :)

[@sujathasivakumar6422]

Super sir really it was good

[@isururambandarage1421]

Great video, thank you very much...

[@munavvaralam1243]

Gazab sir

[@SAISRIVIDYA66]

Tq sir for ur awesome explanation. Tq sir

[@upendrakushwaha5123]

how can i decide which one go left and which one right

[@Haniye-t5u]

thank you thank you 🥺

[@MDASIF-wo7ck]

Well explained

[@UnBoxerBHAI]

SIR THERE IS ONE REQUEST PLEASE SWITCH BACK TO TEACHING ON BOARD AS THOSE VIDEO'S WERE MORE INTRESTING THAN THIS. LOVE YOUR VIDEOS

[@abhinashjena216]

Can u please make a video on overall dsa content for basic to advance

[@ShubhamKumar-xg3hc]

Thank you sir 🙏

[@furkhanmehdi6405]

bari sir thanks...

[@vinaykumar5791]

where is 9?

[@tanvirhossain3371]

effective .. very much effective !!

[@kunalkheeva]

thank you!

[@adarsh1360]

Sir does your Playlist on algorithm complete ??? If it ain't then please complete 8t before 15 of this month..🙏ty for consideration.

[@adarsh1360]

We have upcoming end sem from next month plus i have to go for gate prep

[@adarsh1360]

You are doing excellent job sir Allah is showing kindness to us through you sir

[@adarsh1360]

Nope it's complete. Go for data structure as well sir

[@somiashobo8359]

thanx alot may Allah bless u awesome explanation...

[@gamesfindy]

your material is very information and your way of teaching is too good . i have some questions related to your topic can u plzzz tell me Why BFS take a lot of space than DFS, although their space complexity is same? and why we implement BFS by only using queue?

[@zarwabutt4661]

but sir , we have read that BFS searches breath wise, but when we see this traversing...it seems like random traversing .....

[@HardCodeDev]

❤

[@ashish3saxena]

Thank You so much

[@ashishsinha8893]

sir I m waiting for your next videos.... sir upload please..

[@tonnysaha117]

Thank u sir

[@shaikhibza8596]

Sir please explain me videos on minimum cost spanning tree by using sollens algorithm sir

[@bluesky_10]

in bfs 9, you forgot to visit the 9

[@vrushalikokarebarkade8873]

Awesome

[@Anytime4yo]

thnx sir ,,,,,,,,,,,,,,,,

[@faranahmadk7401]

thanks :)

[@amanrubey]

dfs is cool

[@pagovindaraju2147]

Nice

[@hardeepcoder]

what's about 9 in bsf ?

[@ahmedalrashi8175]

i think he forgot it but it should have been added to the queue

[@ayyappachintu7218]

Hardeep Singh 😂😂

[@safaaal-wajidi4606]

thanks

[@gandharavkatyal822]

thanx :)

[@SayanBanikAuthor]

5:55

[@md.yeahiakhan3415]

thx

[@mohammedayaz855]

thank u sir :D

[@dakshasindal9422]

Disliked. Incorrect explanation.

[@ashish3saxena]

How?