Tree Traversals- Preorder traversal

preview_player
Показать описание
Link to awesome help site:

Check out my website and like or comment any other tutorials you would like to see!
Рекомендации по теме
Комментарии
Автор

This is the best explanation I've ever seen in my entire life. You are the real deal.

venkarri
Автор

Every school must have a teacher like you sir!
you made such a simple thing look even more simpler and fun too!
thaaaanks!

jasluvdeepsingh
Автор

Hats Off to such people. I'm in the 12th grade and understood your explanations much better than my teachers; infact there is so comparison. Thank you sir!

pinakrox
Автор

Very well done. This helped clear up a lot about what was going on. I'll be watching the inorder and postorder videos as well to help out with my discrete structures course I am taking.

SporNightReloaded
Автор

shouldn't the 12 go on the right of 1 ?

murtuzadalal
Автор

Clearest tutorial out there. Would be even cooler if you explained the recursive and iterative versions of pre, in, and post order. Thumbs up !

rockerindemands
Автор

Don't you have to bubble back up to the root node to know that you are officially finished with the traversal?

tylercruz
Автор

thanks dude, you're explanation is crystal clear!

dalalalghomlas
Автор

omg thank you. really going to help me with my data structures final

TheShanaList
Автор

What if I got 2 Path, how can I get the tree?

hellomjow
Автор

Could you share a more complex binary tree's pre order traversal ?
Thanks...

nihat
Автор

why is there an annotation that 12 is incorrect?

xoppa
Автор

Wow thanks, you really cleared this up for me.

Chelsea_Alexis
Автор

I need a computer science professor that says, "What's Gucci everybody." Very helpful video!

tylercruz
Автор

All I am going to remember from this is "What's Gucci?"

armylaptop
Автор

a lot this helped me a lot i didn't get the tracing until i watched this so huge thanks to you !!!! "it would be awesome if i find any java2 tutorials" THUMBS UP :)

ARWA
Автор

Dude Thank you so much. I finally got the point !

lespaul
Автор

This is damn useful. Much appreciated.

vivs
Автор

if you have 2 paths then it is not a tree, it will be called graph

luaieh
Автор

next time you should also write the algorithm in pseudo code for us to understand better

shaulrosenberg