If you have accepted that recursion is hard for you believe me none of human of this planet will be able to help you understand it. Accept that you are pro in programming. My mantra (Words of Josh Kaufman/The First 20 hours, not mine😅)
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+💂
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
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.
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.
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.
Question for anyone who can answer: what would be the use for preorder and postorder traversals? Inorder traversal outputs a sorted list, reverse inorder traversal outputs a reversely sorted list, and breadth traversal gives the correct order in which to draw the tree. So, what are pre and post good for?
I have to say this is one of the most clearer explanation I have found on RU-vid, 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!
🙏🙏🙏🙏no words awesome channel no tutorial at local place can't teach better than this pleas go on continuing sir.and btw try to upload videos of java oops concept.
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.
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.
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 :)
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!
