Binary Tree Traversal - Preorder, Inorder, Postorder

preview_player
Показать описание
Hey Everyone! In this video I discuss how to implement and understand the process behind the 3 common Depth First Search (DFS) techniques (Preorder, Inorder, and Postorder) traversal. I go over the stack frame, code and tree walkthrough. Enjoy :)
Рекомендации по теме
Комментарии
Автор

This video deserves millisons of thumb-ups.

zhengyili
Автор

The method of explaining the difference between pre, in, and post-order made so much sense to me, thank you for this.

prestonleon
Автор

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

marhawk
Автор

I finally understand how Recursion works

universedimension
Автор

This content needs more likes... simply superb content

RajeshSamson
Автор

Hey Everyone! Thanks for checking out my video! Don't forget to Like, Subscribe, and MOST IMPORTANTLY click that Notification Bell for updates! :)

BlueTreeCode
Автор

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!

akshaynegi
Автор

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.

topiary
Автор

where are the insert delete to binaryTree video ?

themonster
Автор

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

angiolg