Pre-order tree traversal in 3 minutes

Step by step instructions showing how to do pre-order tree traversal on a binary tree.
Code: github.com/msambol/dsa/blob/m... (different than video, I added this retroactively)
Source: en.wikipedia.org/wiki/Tree_tr...
LinkedIn: / michael-sambol

[@cugamer8862]

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.

[@88zachary88]

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.

[@flurple6921]

@@I3uzzzzzz I see you've set aside this special time to show the public that you weren't raised right

[@synq-_-8595]

@@VatsalRajyaguru17143 fuck you too

[@kolibri5861]

no I am actually working on Top-down parser for the compiler I am designing>.>

[@zahirsonny7689]

I guess im asking randomly but does anyone know a method to get back into an Instagram account??
I stupidly forgot the password. I appreciate any tricks you can offer me

[@coltenraphael1268]

@Zahir Sonny Instablaster :)

[@magscovers8924]

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.

[@ugestacoolie5998]

I hate long lectures where you have to go through the entire things to just filter out maybe a few minutes of useful content, but this video, 3 minutues, pure gold

[@zinaright]

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

[@matthewsmith1571]

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 :))

[@manasabokka783]

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

[@ferengiprophet2185]

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.

[@RECTmetal]

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

[@udanamethmal6632]

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

[@zboobafett5984]

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 !!!

[@ludendorf1899]

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

[@snipo39]

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

[@muyangyan]

Concise and no weird language. Thank you

[@gorkemkayas]

Thanks for clean explanation

[@bvwalker1]

Very nice explanation. Thank you! Subbed!

[@DanielLochner]

Absolutely brilliant!

[@angelvasquez9468]

Great explanation. Thank you.

[@maryamd6396]

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

[@sreehari563]

extremely helpful,thank you😘👍

[@dinner4chiahao]

Brilliant video!

[@Ashkan55628]

Best Explanation

[@kathipogudavidpaul3634]

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

[@giliaki1995]

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

[@maremp5]

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

[@MichaelSambol]

+maremp5 Yes!

[@merajis]

Awesome! thanks

[@ameypote8148]

God bless you !

[@user-sr1pp7sv9q]

Thank you so much

[@mohammadrezajavadi3498]

Excellent

[@peterzhou3366]

thanks for sharing

[@robertp2552]

Thank you! :D

[@mehmetemineraslan5948]

THANK YOU SO MUCH

[@MichaelSambol]

❤️💪🏼

[@EndieM8]

please keep making videos

[@moustafa_elsaid]

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

[@dudez5312]

thank u dawg

[@salmanalimughal6386]

THNX :)

[@daveydaveywigwam]

Nailed it

[@Resorization]

Thanks ;)

[@yeah5037]

thanks!

[@moustafa_elsaid]

please give video for graph traverse methods

[@aemilious6267]

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 ;) )

[@aemilious6267]

And also always traverse from left to right so from the root node go to left first

[@nuclear804]

thanks laddy

[@leizhang3329]

good

[@australia7003]

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

[@anonanon6596]

TH-cam now ai-translates titles and I hate it.
To translate the title that shows up to me back to english: "Pre-sale on trees. Order now in 3 minutes".

[@MichaelSambol]

Ugh

[@tweets009]

hello a level exam people

[@mladenkaorlic6028]

You should get salary instead of my teachers...