Pre-order tree traversal in 3 minutes

good

Excellent

hello a level exam people

Brilliant video!

Thank you so much

THANK YOU SO MUCH

u are a sexy man. thank you great video and explanation

Very nice explanation. Thank you! Subbed!

omg this was so simple yet so effective, thanku so much

Dude you saved my life. You just explained a concept my data structures professor was trying to explain in a 2 hour video. He overloaded us with so much information that the important parts were incomprehensible.

thank u dawg

thanks!

Good explanation dear friend.... I helped me a lot 👍👍👍🙏🙏🙏thank you 💖😊

This video and the other one you have on post-order tree traversal are absolute gold. Was so confused by how recursive functions work (especially with the return keyword), but this is definitely helping me piece it together :))

Thank you! :D

Concise and no weird language. Thank you

Thank you! You're an amazing teacher. You were able to take a complicated concept (at least to me) and able to explain it in plain terms.

Just follow this rule it might not be the same with the actual code implementation where stacks get pushed and popped but if you want to do a quick traversal follow this tips : 1-In Preorder traversal the first time you reach each node you perform your operation (visit) 2-In Inorder traversal for the second time you reach each node again , you perform your operation(visit) 3- In post order traversal for the Third time you reach each node perform your operation (in this case visit , you can do whatever you like ;) )

Michael I just wanted to say I love you so so so much. I have seen this videos and many others videos and that helped me a lot in my student life. You're a genius !!!

You should get salary instead of my teachers...

clarity, while you explain, is amazing, the way you strike visit, left, right to indicate the call stack is very helpful to imagine recursion.

Finally, someone who explains algorithms and data structures using plain English instead of mathematical notation. Not all of us had the benefit of a four year CS education, you're doing a great service here.

Who tf disliked this masterpiece video? you all have special places in hell reserved!

I want this guy for every concept I need to understand. Absolitely spot on, brief and concise

Best Explanation

Great explanation. Thank you.

thanks for sharing

thanks laddy

Thanks ;)

Nailed it

please keep making videos

Thank you for making a nice clean and straight forward explanation!

Absolutely brilliant!

Thank you so much for your efforts at beautifully explaining this and other algorithms. Subbed.

Thanks for your effort, can you please
make the same for graphic traversal?

extremely helpful,thank you😘👍

Dude thanks a whole freaking lot for these 3 videos. Saved me a great amount of time

God bless you !

It's so nice to get explanations which aren't from an incoherent Indian man. Thanks, keep it up!

please give video for graph traverse methods

Fun fact: if you apply pre-order traversal of a BST on the British royal family tree (ordered by age) this is how the crown is passed along.

THNX :)

Awesome! thanks

is there any chance you will do Dinic's algorithm? Thank you

Hi! Your videos have helped me out a lot for maths. I was wondering if you could do a video on the Route Inspection problem(Chinese postman problem). Thanks x

I like your explanations, every single video was helpful. Could you make videos about drawing different trees, like AVL, Red-Black and B-Trees?