Glad you found the tree-traversals simple and easy to understand!! Please don't forget to share / recommend the channel on social media to help it grow.
You just earned a sub. I’ve been having trouble understanding tree traversal and recursion...this video itself cleared up all my confusion. From how you explained it to the animated walkthrough. Thank you! You are truly underrated
You've really made these data structures super easy to understand in all your videos. Could you please also cover certain advanced stuff like Graphs/Dynamic Programming/ Greedy algorithms too? Thanks a ton!
@akshay negi Thank you for your kind comment :). I currently plan to post videos on Hash Tables ,Graphs, possibly Binary Heaps and Bloom Filters as these would complete the fundamental Data Structures.I also plan to post some non-data structure topics in JavaScript. I will definitely consider dynamic programming and greedy algorithms.
I've really enjoyed your videos and they have helped me a lot with my data structures class. I'm just wondering if you moved to another platform or if you still make videos somewhere else because I really like how you teach and I would like to see more videos from you.
Thank you so much for the kind comment, David! At the moment I cannot record videos due to the amount of work I'm doing, but eventually I will make a video that covers all the main sorting algorithms instead of splitting them up into several videos. If you enjoy this content, feel free to share this/other videos on social media as it helps out the channel a lot.
After you pop 20 off the call stock and you go to 40, how does the algorithm know that you haven’t yet gone down the right child of 40? I don’t understand how that’s tracked
Hi Gabriella, so the recursive calls come from 1 of 2 places. Either from the line (left.preorder) or the line (right.preorder). If for example (left.preorder) was hit, then in that stack frame, that is the point where the function will continue executing from when that stack frame reaches back to the top of the call stack (so line 5). (So every stack frame knows exactly which point (line) it was at before the next recursive call is made). That's why when 40 is back at the top of the call stack, it continues from where it left off (line 5). Hope this helps :)
This video deserves millisons of thumb-ups.
Thanks, Zhengyi Li! :)
The method of explaining the difference between pre, in, and post-order made so much sense to me, thank you for this.
Glad you found the tree-traversals simple and easy to understand!! Please don't forget to share / recommend the channel on social media to help it grow.
This content needs more likes... simply superb content
Thanks, Rajesh!
You just earned a sub. I’ve been having trouble understanding tree traversal and recursion...this video itself cleared up all my confusion. From how you explained it to the animated walkthrough. Thank you! You are truly underrated
I finally understand how Recursion works
Glad I'm able to help! Don't forget to share as it helps out the channel.
Hey Everyone! Thanks for checking out my video! Don't forget to Like, Subscribe, and MOST IMPORTANTLY click that Notification Bell for updates! :)
This explanation is awesome!
Glad you found it helpful!! Please don't forget to share / recommend the channel on social media to help it grow.
You've really made these data structures super easy to understand in all your videos. Could you please also cover certain advanced stuff like Graphs/Dynamic Programming/ Greedy algorithms too? Thanks a ton!
@akshay negi Thank you for your kind comment :). I currently plan to post videos on Hash Tables ,Graphs, possibly Binary Heaps and Bloom Filters as these would complete the fundamental Data Structures.I also plan to post some non-data structure topics in JavaScript. I will definitely consider dynamic programming and greedy algorithms.
thanks bro. love from VN
I've really enjoyed your videos and they have helped me a lot with my data structures class. I'm just wondering if you moved to another platform or if you still make videos somewhere else because I really like how you teach and I would like to see more videos from you.
Thank you so much for the kind comment, David! At the moment I cannot record videos due to the amount of work I'm doing, but eventually I will make a video that covers all the main sorting algorithms instead of splitting them up into several videos. If you enjoy this content, feel free to share this/other videos on social media as it helps out the channel a lot.
where are the insert delete to binaryTree video ?
Thank you so much!
Thank you so much! Please don't forget to share / recommend the channel on social media to help it grow.
please continue
After you pop 20 off the call stock and you go to 40, how does the algorithm know that you haven’t yet gone down the right child of 40? I don’t understand how that’s tracked
Hi Gabriella, so the recursive calls come from 1 of 2 places. Either from the line (left.preorder) or the line (right.preorder). If for example (left.preorder) was hit, then in that stack frame, that is the point where the function will continue executing from when that stack frame reaches back to the top of the call stack (so line 5). (So every stack frame knows exactly which point (line) it was at before the next recursive call is made). That's why when 40 is back at the top of the call stack, it continues from where it left off (line 5). Hope this helps :)