Binary tree traversal - breadth-first and depth-first strategies

[@yokeejr5092]

10 years later and there is no other video that explains this topic as intuitively as this guy did..Kudoss to thiss guy💪🔥

[@ahrik-7]

Dude, you're like one of the few people I'd comment on.. your work is amazing. You've brought insane amount of clarity to each concept.

[@JangBahadur3028]

He is dead... man. In road accident.

[@alextech4881]

@@JangBahadur3028 the speaker is not dead, but sadly his mate is. Rest in peace!

[@hornyjesuz]

​@@JangBahadur3028really? Loss is incomparable 😭

[@LearnwithChampzz-rv4lk]

Life is full of circles!! Few years ago in 2020, I was watching your video to get my first job in college placement and now here i am again!!

[@dhillaz]

Excellent lesson. Related Leetcode exercises: 144 - Binary Tree Preorder Traversal 102 - Binary Tree Level Order Traversal

[@yosuanicolaus]

Thank you very much for your explanation on DFS! Understanding about DLR, LDR, LRD really just makes everything 100x simpler.

[@altechy7304]

There are people who teach, because they hold a degree, and that degree allows them to do what ever they want. And there are people who have actually the skill of teaching a special subject. Few Universities in the US have skilled teachers... Thank you so much for sharing your expertise with the world!

[@MhZnSO4]

The level of clarity in concepts i gain after your watching videos is PHENOMENAL! Keep up the good work. Open up some portal where willing people like me can give some money to your efforts.

[@711tornado]

I agree. Often it's hard to find people who teach things in such a precise and clear manner. I remember when I first started programming in C from Java, the concept of pointers absolutely threw me through a loop and the common explanation of "It's just like a reference in Java!" didn't cut it, mcodeschool's lesson on pointers had excellent examples and helped grasp the concept perfectly!

[@Ankit-mq6em]

Animesh Nayan sir you are great and can be leader in whole india if you open your online courses as well as offline institute sir .You will rock and beat all others easily

[@amanrai8010]

@rocky rawlo Bro he is alive his cofounder Harsh Surnyan is no more

[@cripplingdepression8889]

These videos are way clearer than my engineering school's courses THANK YOU SO MUCH MAN YOU'RE THE BEST

[@gauzammalhotra]

what a name lmao

[@ribaker822]

You have got unusual clarity and insight into the concepts you teach. People like you are a breath of fresh air in CS. Thank you for deciding and taking time to do these series!

[@mohbob]

Honestly believe your teaching standard is THE best I've come across !! I'm from london UK but currently wishing I was in India just so I can study in your boot camp !

[@mycodeschool]

Mohbob Ali Thanks a lot :)

[@lakshminarasimhanb]

Your preorder inorder postorder explanation is fantastic that cleared my intrinsic confusion.

[@nickorefice7323]

Thanks for the upload! The coloring of nodes during traversal really helped with my comprehesion

[@camillesatoshi8393]

Hahaha, I have never seen an explanation so clear, step-by-step. There is no space for doubts in between. It's a piece of "for dummies" mastery. Thanks

[@joeybing3476]

best set of tutorials I've came across. outstanding!

[@pranavshukla7188]

One of the best explanations I have ever seen on KZbin.

[@addadd8784]

thank you. easy to follow and great visuals. 10 years on and this is still great.

[@akhilgupta3664]

The concepts after watching these videos are reached at hight level. After watching your videos , I feel confidence in that particular topic. Thanks Sir !!

[@chandumudiraj2582]

After watching this video I thought this is a one of the best channel I recommend for learning data structure easily... Thanks a lot for the explanation

[@NeeliMegha024]

I am watching your video's from couple of days and i haven't watched anything better than this. You are really helping people to understand real concepts. No noise. Gr8!. Please continue and help people.

[@mashable8759]

Please i recommend everybody to see all his lectures. THey are better than any college teacher :o THANK YOU So MUCH SIRRRRR

[@snigdhasingh533]

The best explanation across the internet

[@sa25078]

Ita still relatable even now .Thanks for such an amazing explaination😀

[@rbsupercool]

who the heck dislikes this videos... these are the best..

[@sravansainath7980]

I was in 6th class when this video was uploaded ,now i am in my 3rd year b.tech

[@tanminator_]

You guys just keep saving me time after time!!!! Great work. :)

[@amansinghbhadauria2818]

Why did you stopped making videos? We need a hero like you to understand these concepts clearly.

[@0x1h0b]

It's a very sad story actually, i found out while reading one of his interviews on why he stopped making videos.........initially they were 2 friends who started making videos and unfortunately one of them passed away, he had an accident or something... after that videos very less frequent and eventually he stopped making videos ..now he focuses more on his family and full time job....that's all i know

[@aryanverma7800]

Agree its difficult to manage youtube.....but still you can do a live stream to chat with your students.....and share feelings with us....that would be great

[@Mari22R]

You are the best professor ever! Thank you so much for posting videos

[@tsunningwah3471]

is

[@pramodkumargupta6269]

You guys are doing great job!! keep it up, your explanations is far better than any book or lectures, concise and simple !!

[@ankitajain4194]

Best tree traversal explanation.

[@ajinkya90swim]

I love this guy!!! very clear and systematic approach.

[@IRLVaporwave]

OMG I FINALLY GET HOW TRAVERSAL WORKS. THANK YOU!!!!

[@alexdesouza140]

Outstanding explanation like all of your other videos.. thanks for your hard work !!!

[@javayriyab4001]

you explain it so well, thank you :)

[@jay_ndimande]

this has to be the best explanation. 🥺

[@batemanyorayamba4441]

As in.. This explanation is superb and uncomplicated like those the school lecturer gave

[@ChauNguyen-nb5so]

Your videos are so helpful with all the concepts in my Data Structure class. Thank you so much

[@bayazidtamim7654]

your this video helped my exam preparation

[@nesliemmanunday3682]

I was here from TOP.

[@salthesadmanshark5645]

this was a very well made video, concise and well explained. Thumbs up .

[@saanviahuja1]

This was just wow 🙏 Very clear explanation

[@adamrizk6735]

Awesome video, thanks for uploading this

[@kartikxramesh]

Can someone please explain why Inorder traversal of a binary search tree gives a sorted list? at 11:27 the list has the order G H I. now I is definitely greater than G. but both G and H are smaller than I, so how come G is before H necessarily? It could be reverse also?

[@MrWhiteMischief]

Whats your name buddy? ..your videos are the best I have ever seen.. the way you explain and use diff colors and how overall video is made.. great work.. thanks a ton!

[@AnitBasuThakur]

+Harsh Saha Animesh Nayan.

[@brandonklein1]

Really fantastic clarity! Thank you so much!

[@NqobileSayi]

Very understandable... Thank you

[@metarun]

Inorder traversal only gives the sorted list if the tree is Binary Search Tree, a very important thing to remember.,

[@yeah3722]

This video was amazing, well done!

[@punstress]

Excellent visualization but why didn't you post the link to the next one?

[@fisslewine1222]

Great tutorial, do you have anything for node deletion?

[@wandererstraining]

Well, that's one more of your videos that makes it to my favorites... Again. 😁

[@deikan416]

excellent video, i really appreciate your method of explanation.

[@quantum_yt4790]

nice explanation

[@ImranAliyev]

Excellent explanation!

[@rudiboshoff8201]

Amazingly clear video, Thank you!

[@nandatkumar]

Hi, Thanks for the explanation. Its very great explantion... thanks again

[@folksgames7047]

Very helpful, thank you!

[@sathishs5840]

post order traversal of the tree should be A,C,B,E,D,H,I,G,K,J . at 11.49 last two node is reversed.

[@terryparrish6763]

Very good example!!! I really was able to follow. Thanks!!!!

[@nabilmuthanna6083]

first of all,I have been watching your videos and they are really helpful thank u for that. I just have question so for traversing the tree in depth-first or breadth-first , the time complexity is O(n) because I have to visit every node on the tree what about the space complexity for depth-first and breadth-first..? thanks in advance.

[@mycodeschool]

nabil muthanna : space complexity will be O(n) in worst case and O(log n) in average case for depth-first. For Breadth-first , space complexity will be O(n) in average case. So, depth first is efficient in terms of memory consumption. I'll explain space complexity analysis in detail in coming. lessons.

[@nbotelho10]

Very nicely explained, thank you!

[@DenisBTV]

Awesome explanation!

[@christiangarmay4667]

Thank you. I can answer my exam tomorrow.

[@usama57926]

amazing algorithms

[@KnightVsMinecraft]

Thanks :) very helpful

[@Sam-oc7nm]

Man, you are the best!!!!!! thank you so much!

[@demigod6190]

you just broke the concept men!

[@AjinkyaKapseiajinkya]

thank you so much..which software did u used for this tutorial..?

[@ManishKumar-qx1kh]

Sir can you upload videos on heap tree please.

[@markliu22]

thank you, very helpful dood

[@ANKITKUMARapple]

Thanks a lot sir! for making such an awesome video. Clarity of Concept->Excellent Sir,I have a doubt can u please tell me tree programmings are more efficient in C/C++/Java. I have followed all of your lectures.

[@ForcedPositivityMalayalam]

I know I'm like 7 years late to the party, but for anyone who can't remember preorder, postorder and inorder, think of it like this: The convention is always to read Left child before Right child. Preorder: Root is "pre"-read to Left and Right. Pre meaning before. That is, root > left > right. Inorder: Root is "in (between)" Left and Right. That is, left > root > right. Postorder: Root is read "post" Left and Right. Post meaning after. So, that would be, left > right > root. Hope it helps some random stranger. And btw, I'll give the credit for this "mnemonic" to Jenny from Jenny's Lectures. I watch both her and mycodeschool's videos to get a good understanding of the concept and the algorithm.

[@riazlatib]

Thank you for your help!

[@arush2323]

sir, we all are waiting for your up comming videos...please be quicker.. :D and BDW I just love the way you teach...keep these amazing videos comming...

[@jaxongirrahimov7908]

superb as Feynman

[@AhmadAwais]

Awesome! How do you record these videos? What are you using to write and highlighting and stuff? Looking forward.

[@R9000S]

+Ahmad Awais just checked out ur cool website. and dang u have a lot of twitter followers

[@ordinarycoder8090]

great explanation

[@deveren]

from odin!

[@noice1006]

Same

[@deveren]

@@noice1006 wish ya luck keep it up

[@harithabandara3212]

Thank you very much!♥

[@mikemassoom]

Outstanding!!! Thank you

[@iwayanbagus2271]

I tried to figure out the value in Postorder traversal, mine is A,C,B,E,D,H,I,G,K,J,F. CMIIW

[@divyanshsharma7406]

kindly provide the video transcript of your lectures as provided by coursera

[@ElTexMexAlex]

You taught better than my teacher.

[@kausachan4167]

is that me doing data structures so well !!!

[@koustavannu]

just luvd it. teaching style z just awesome. very much helpful...!!!!

[@prabh557]

*Sir u should write a leacture number..it will be helpful*

[@Confusedalien1133]

Lol this channel died because his friend died and now he is back to working at microsoft sad!

[@ArkamitDutta]

Is it possible to do inorder or postorder traversals in BFS?

[@krishnakandula6587]

Woderful ! Thank you.

[@bbs-3358]

so the Post Order in the video is correct?. And inorder - how come is G, H, I? why is it not H, I , G , J, K? ** can someone explain to me :(

[@sathishs5840]

try to visualize the each node and left subtree and right sub tree and solve each sub tree with the order

[@Historyiswatching]

Is preorder, inorder, postorder only applicable to DFS? I'm confused by the wording from your video. Do we not use those 3 orders for BFS? Thank you

[@Iam_inevitabIe]

Yes, in BFS there is no preorder, inorder and postorder because we just traverse from left to right in each level until the tree is done

[@viktorull]

And when it have cycle (be a binary or any kind of tree, for example in that Arad to Bucharest map example) how the breadth-first and depth-first search behave?? could i put the repeated leaf node again? Thanks!!

[@MaminaZvezdochka]

Thanks so much for it! 🔥

[@raiyanhossain691]

Thank you sir.

[@ArifA]

If the height of left sub-tree and right-tree are same, then what would be the return value from max function?

[@anirvansen2941]

Great Stuff!

[@raffy3304]

Please make a vid tut on how to draw tree from pre,in and post traversals? thanks

[@garywhite8274]

You mentioned a word starting with "c" several times in the 1:50-2:10 time frame and I cannot understand what you're saying. It sounds like "craft" and that's how it's being interpreted by the auto closed captioning. What is this word? Thanks.

[@garywhite8274]

Are you saying "graph"?

[@mycodeschool]

Gary White Yeah, I am saying "Graph". May be I need to upload subtitle for this one. And I think "graph" would be pronounced properly moving on. :)

[@garywhite8274]

mycodeschool Thank you

[@aryanverma7800]

@@mycodeschool when are you posting videos back on youtube

[@hemantyadav1047]

The only way to understand anything is to do it recursively. Just like dfs

[@dariogpb]

great video thank u

[@aryansathish]

Thank you