Binary tree traversal: Preorder, Inorder, Postorder

[@FabianLopez_lomba]

I've lost track of how many times this chanel has saved me. Great job!

[@mycodeschool]

Fabian Lopez Thanks a lot :)

[@hafizulhimel3655]

Fabian Lopez add #include header file..ty

[@mohamedeljahmi2454]

I agree. God Bless the instructor.

[@fauzytech]

Agree.

[@prachijha4258]

For me as well

[@Tommy-yq6vr]

100 times more clearer than those overly complicated computer science books that look like a robot had written them.

[@mohitbv2331]

you are right, he has explained it quite clearly.

[@being1better801]

True

[@FarhanAli-km5id]

🤣🤣🤣

[@joshuasheppard7433]

Spot on .... I'd say 10^9 times clearer.

[@paingoo1370]

I second that

[@sarkarpiu1]

After studying it almost everywhere else around a million times, this video finally helped me understand the pre, post and inorder traversal of trees. Thank you so much for making it so easy to understand. I think every computer science student needs to watch this video.

[@CSERISHINANDHA]

If you noticed, in every single video where he assumes some random addresses for nodes, the minimum difference between the address of any two nodes will not be lesser than 2x(number of bytes occupied by the node in a 64 byte operating system). Meaning, he always stays alert in what he's doing. Respect+💂

[@fsandovc]

I have to say this is one of the most clearer explanation I have found on KZbin, everyone explains the ROOT/LEFT/RIGHT and the code part. But the majority don't explain how the memory is managing the nodes data and how it returns it back. Thanks a lot!

[@unknownguywholovespizza]

This channel is pure gold 🥇. Everything is just clear without someone showing off instead of teaching. 😀

[@MisterHorsey]

The call stack visualisation @ 9mins or thereabouts is a really nice way to illustrate how recursive calls are paused to allow the further recursive calls to complete. This has been the biggest issue I've had in trying to get fully comfortable with recursion as I'm forever trying to track them all in the head!

[@mudassirshahzadkk]

6 years old but still much better than other latest videos on this topic.

[@erics4433]

This was very helpful. I was getting a bit confused on how exactly the recursive code was behaving in relation to the tree and your side by side approach really cleared it up for me. Great job, thank you!

[@adityaojha2701]

Nothing can be better than these playlists.

[@shivampatel8850]

your visual explanation of recursion function is very influensing and good

[@wastingtime6211]

Explained really well! Still helping someone 5 years after the video was made now that's quality this is timeless.

[@mehershrishtinigam5449]

I will never forget any of the tree concepts now. Thank you.

[@kevin-kuei]

Just wanted to say I really appreciate these algorithm videos. Great explanations, diagraming, and delivery all around. Looking forward to exploring more of your content.

[@向前走五十五步]

This is the most elegant explanation of preorder, inorder and postorder. Thank you so much!

[@armadonluvr]

Studying for my midterm, and this is one of the topics tomorrow. Can not thank you enough for a clear, concise, well drawn, and well thought out explanation. Thanks dude

[@anjalidarokar2408]

Sir, you have taught the concepts excellently- no one ever explained these things, the way you did.....!!!!! Thank you for all the pain that you took to come up with such informative videos.....!!!!!

[@GhanshyamDobariya90]

I m front end developer... to learn tree I have seen many videos but this one I loved and felt more easy to understand....

[@shefaliemmanuel7286]

½ way through a data structure and algorithms course- this channel is a LIFE SAVER

[@jacquelinelee9836]

One of the most talented tutors I've ever seen on KZbin!!!! You Rock!

[@hangchen6131]

Awesome walkthrough of the recursive function of the traversal of a binary tree in detail with a stack structure illustrated! I now fully understand the magic behind the code! Your videos are the best data structure tutorials I can find so far! Thanks :)

[@shrutipulstya9]

thank you for not having any ads and great explanation .

[@vjkumk]

Finally able to understand the tree traversal in proper and easier way after looking at so many you tube videos!

[@fmacoful]

You save my life from Christmas homework. You are the hero. You are hope of humankind!!!

[@abhinavanand4129]

Yours videos are building up careers of so many people's across the world and I m one of them thanx a lot sir..

[@lukevassor7743]

I think you just saved my M.Sc. exam. You sir are a legend, recursive thank yous with no cap.

[@JackMarchetti29]

Probably the best explanation I've come across for traversing a binary tree. This was really great.

[@LATRIBUNEVLV]

Your work is more clear and usefull to me while i try to get my degree than most of my classes and teachers, thx :)

[@chiragjain1424]

This playlist is still the best, even 6 7 years after it was uploaded

[@monicaslv323]

Recursive is such a complex thing to understand...but you helped a lot. Thanks so much.

[@divyanshpandit6509]

this man is brilliant! just look at how well he explains these tricky topics in such an intuitive manner

[@markpascual100]

by far the best explanation for tree traversal on youtube

[@husseinbakiri5320]

really fruitful.i usually learn through these videos before i teach my students.brief and clear.thank u sir.

[@veritas7010]

The most clear explanations of all youtube, thank you!

[@sohinichaudhuri518]

You are missed by all of us ... pls come soon ... u are the legend ...

[@atonewiththedust]

I think I've finally wrapped my head around recursion thanks to this video. Great explanation!

[@md-ayaz]

I owe you a lot brother. You should continue making videos.

[@arvind617]

Wow...u explained the recursion process really well..way better than other videos on the same topic!!

[@cytriax8657]

I'm studying a Computer Science course in Uni, you clarified within the space of this video and many others what my lecture could not in 3 weeks in relation to data structures. Yay, I think I won't fail my unit now!!! #Hype

[@ThuyNguyen-bu9ge]

I think you made a mistake with In order, there is no H in the binary tree, yet there is one in your list.

[@mycodeschool]

Yeah, That's a mistake. :( I think I have put an annotation to mark the error.

[@vanjavk]

+Tiffastic Nguyen yeah noticed it too :D

[@MohitK96]

+Thuy Nguyen You tried that's why you noticed, it's essential to keep track of every step during recursion in order to learn it.

[@fuzailmohamed8619]

mycodeschool ,while watching it on mobile there are no annotations.

[@venkateshrayala2440]

I figured that

[@johncenakiwi]

This video is actually the best video for understanding recursion.

[@ORagnar]

This guy is an exceptionally good teacher.

[@aleksey5315]

Greatest explanation of tree traversals I've ever seen! Thank you so much for making it so easy to understand!

[@brendanmuscutt5001]

Thanks a lot. I am from Germany but I prefer your videos to any other in my language. You are really talented in expaining

[@27priancygahlot]

Beautiful explanation.I was stuck for many days in BST.Thanks for saving me out .Great Job guys.Kudos!!

[@natureauthor]

Thank you so much! This video was very comprehensive and incredibly helpful. I love that you put so much thought and detail into explaining this concept.

[@iamrajagrawal]

You explained so nicely that even a 5th standard student can easily understand this...Thank you so much!

[@mahmoudtawfiq6219]

why is the GOAT not uploading anymore?

[@shahilushah]

Hands down the best channel to learn data structures!!

[@parthaprateempatra4278]

This is a gem of a channel.

[@altondsouza2311]

Great work! The explanation was thorough. I actually found it difficult understanding it from the book data structures using C, but then referred to this video which saved my time.

[@sufian9951]

very easy to understand. respect from BANGLADESH .

[@priyankjain4082]

A crisp and concise explanation! Stuff that clears every doubt just in the first view!

[@dembashow]

this man is really great I don't know why his videos are not number1 trending on youtube

[@shubhsharma19]

one of the cleanest explanation ever

[@JD-po3uk]

the most thorough video i have seen

[@MohitK96]

Whenever I forget traversals, this channel always helps :)

[@vivian_who]

This is my favorite subject in university, because of you!

[@krshah2008]

You're awesome. I was having so much confusion about recursive function, but your video cleared the entire concept. Thank you very much

[@rd-cu1vo]

i was a lot confused about the recursion but it made everything clear. thanks a lot!!

[@santiagobenitezperez5240]

man, amazing visualization, i couldnt understand but this video was what i needed

[@jalavadinaveen7824]

Wow superb explanation broo really awesome I searched soo many videos for those steps but I didn't understand after watching your video only I cleared understand really awesome explaination broo

[@CSERISHINANDHA]

I don't know if any of you noticed it, at 13:08 , the node for letter 'H' is missing but he wrote it in the result

[@paz1359]

after 5 years, I found a tutorial who put me out my misery . thank you so much

[@rbsupercool]

i was waiting for it..finally got it.. every day when i open youtube, first thing i do is check if you have uploaded new videos... thanks a lot.. :)

[@bvwalker1]

Nice presentation! Just an FYI, you have the Inorder output listed incorrectly (around 12:35 mark). You added an "H" by mistake making 11 pieces of data instead of 10.

[@sakshidevi353]

really this video has cleared my all concepts...thanks a lot sir

[@sammyj29]

I have always struggled with recursion but this was such a beautiful explanation! Thank you for making these videos!!

[@varunVyas]

Thanks a million. videos are precise, consistent teaching method, correctly paced, appropriately supplemented with code/pseudocode, concise. Please do some videos on DP and other algorithms that are asked in competitive contests.string matching, graphs etc. Thanks again man.

[@sblasiol]

This is an excellent visualization of these principals.

[@GauravKumar-dw2ml]

Important point is that space complexity is O(h) not O(n) as The addresses are removed from the stack when returning. This space is re-used when making a new call from a level closer to the root. So the maximum numbers of memory addresses on the stack at the same time is the tree height. (source : stack overflow)

[@joedunder4439]

This is so gloriously helpful. Thank you!

[@rohitdoestech]

Still a useful and brilliant video in 2019

[@colesiegel1922]

Fantastic video the visualisations helped so much, looked through many websites and books before I found your vid which clarified everything including time complexity in 15 minutes.

[@dharmendrakumarpandey600]

Just one thing i want to say you.... A BIG BIG BIG THANK U. I got confidense in DS only after learning through #mycodeschool

[@AnilGupta-iv1rz]

I would love to see your videos on advanced data structure topic like adjoint set,trie and AVL tree.

[@dangjustintime]

You explained it way better than my professor

[@mohitvarma1012]

Thanx a lot for all of ur videos !! u really made all this so simple to understand with u r explanation!!!

[@sumitkr.3758]

Best collection of lectures for data structure... Thanks a lot👌

[@fundiaries__1939]

Amazing explanation... best explanation I got till now.. thanks alot... plz make videos on dynamic programming also

[@srisubhashpathuri3909]

Great video. I thank this channel for nicely explaining the video as it bridged the gaps in my professors explanation

[@meitantei69]

I have no idea how much I owe you, thank you for all your videos

[@wokguysrandomstuff5535]

Holy sh*t, finally got my mind clear, the f**king recursions are too hard to see, couldn`t understand how the traversals works, Thank you so much!

[@pato6350]

I just finally understood inorder and postorder, thank you so much!

[@rishabhsahu5257]

Awesome video with full in depth explanation with practical examples

[@sbk1398]

Bruh, keep teaching. It's clearly your field

[@sovanmondal2621]

Best Explanation than all other,.....clean and simple.........thank you..

[@saravanaganesh8826]

Crystal clear explanation... Great job

[@ReneeSLiu-zx5tj]

This might be the one video that brings me out of the abyss of recursion :) THANKS!

[@bsrafael]

This video is just GREAT. Clear and with all the important concepts about the traversal. Thank you very much for this awesome piece of information :D

[@mehularora1813]

Can't wait for the day when he'll be back

[@danimanabat5791]

Holy shit dude this is a miraculous youtube channel that saves me in my DSA subject. Thanks a ton!

[@AnkitKumar-pu2gl]

Better explanation than books

[@JuniorMoreiraC]

Very good lesson! It's really clear the way that you explains and your english it's good too that helps a lot!! Thank you!

[@zainahmadchattha2177]

was a very helpful tutorial , i would highly recommend you to see this about inorder pre and postorder implementation

[@connerjensen8170]

Amazing video! You explain with such clarity and simplicity. Thank you.

[@mrzeuschild]

Thank you so much for the details explanation using visualization, especially the recursion call stack

[@Nightstick24]

Thanks for the video, you broke it down very simply in a way I could understand!

[@at.8887]

You are amazing, you speak so clearly and explain it very simply while my teacher is able to put us to sleep the minute we start listening. GREAT JOB p.s: could you please upload videos about ADT and also combining it with structures, trees and such? having also an example including the whole three: Header.h, Implementatiom.c and Main.c and how to build and work with them

[@JamesBrodski]

Amazing video! You're an amazing teacher. Thank you for this.

[@mycodeschool]

Glad it was helpful!

[@sidduroy9150]

@@mycodeschool how are you sir