Pre-order Traversal Algorithm | Tree Traversal | Visualization, Code, Example

[@AnupatraRuchutrakool]

IIt takes me so long to find someone who can easily explain the stack frame with recursion. This is really easy to understand! Thanks a lot.

[@Mr2Am3]

Couldnt understand what my lecturers were teaching till I came into this video, which was explained in terms of call-stack, where my other teachers failed to recognise. Thank you for saving my grades!

[@byte_easel]

I just wanted to say thank you so much. I know how much this time this must have taken writing the visualization animations but your work doesn't go unappreciated. You going over how it looks like at each frame in the call stack was really essential. Also, I really appreciate the visualization of the print output and where we are in the bst. Thank you so much ygong!!

[@SuperBhavanishankar]

I agree thank you

[@freeBirbBirb]

best video for understanding traversal BST, thank yo so much

[@ragnarokjunekoesco7246]

By far clearest explaination on binary preorder recursion traversal, thank you!

[@afrozakhatun-pr9qj]

thank youuuuu❤❤❤❤ First time i realize this topics of recursion

[@MeisterMattz]

Great explanation! Your animations make tree traversals so much clearer. Thanks a lot

[@expansivegymnast1020]

You dropped this fam 👑

[@SuperBhavanishankar]

😂

[@BeansEnjoyer911]

Wow this wouldve been so helpful back in college. This stuff was a nightmare to me back then. And now a few years later, I'm needing to rebrush up on these skills to stay marketable for interviews... Thanks

[@harishks308]

Great explanation..very useful 🙏😍

[@Srinivasssssss]

This animation really helped a lot...

[@ahmetokur6983]

that was by far the best video , thank you so much for this great explanation. The only thing I don't understand is that after we are done leftmost node(1), we pop the preorder(1) from call stack and go to preorder(2) and what stops program to go again to left child of node(2) here. And instead of going to node1 again it goes back to top. i dont understad what prevent going to node1 again in the preorder2 function in the calla stack.

[@ygongcode]

At 2:36, notice the yellow code arrow. We entered preorder(1) via preorder(2)'s "preorder(root.left)". So when we are done with preorder(1), we have exited out of preorder(2)'s "preorder(root.left)", so we would move onto preorder(2)'s "preorder(root.right)", so we'll never visit node(1) ever again b/c we'll never execute "preorder(root.left)" in preorder(2) past this point.

[@SuperBhavanishankar]

🔥🔥😍😍🥰🥰💖💖🙏🏽🙏🏽@@ygongcode

[@nwokolobueze7291]

Great explanation, the best I have seen so far. I am definitely liking and subscribing.

[@chethanvenkataramaiah6940]

This is seriously the best visualization explanation so far , but how does it pop things out of the stack by remembering? Like when the control hits the leaf node 1 , the left node is null , it returns null, I really dont understand how it remembers the previous execuition of the statement preorder(root.left) was null and proceed to the next statement

[@pelinegriboyun948]

Thank you so much, this really helps!

[@عمرصطحي]

simple explanation thank you so much man

[@kristuze1]

omg, it finally clicked to me!!!!!!!!!!! Thank you sooo much

[@ayanaxhye]

awesome explanation sir

[@htooaung6248]

THANK U BROTHER.

[@alperendilaver.]

excellent explanation thank you

[@AkashRoy-do2dg]

you are a lifesaver!

[@sheikhraisulislam4483]

why just 490 subscription... so good

[@priyanshusaxena7157]

Such a good video....

[@mrcrazy1127]

best video animation

[@CodeWithDanishMir]

can you explain why this preorder(root.right) is automatically called for the parent node even if the pointer is at the child

[@pal2004]

I dont understand why we are making a recursive call to the Root. I mean the First Step is to process the Root, thats Not recurisve ,so why the 5 gets in to the Stack?

[@justbewizu]

good bro

[@longjieguan7275]

very helpful

[@SuperBhavanishankar]

Thank you

[@চর্যাপদ-ট৬ছ]

good video, Can you do this for a post-order video.

[@ygongcode]

Yes, it is here kzbin.info/www/bejne/aonSXnqqd86EhJI