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

  Рет қаралды 17,267

ygongcode

ygongcode

Күн бұрын

A visualization of how the pre-order tree traversal works.
If you like this content, please like and subscribe, so I can make more.
Follow me on my socials and blogs, which has tons of educational resources.
Linkedin: / ygongcs
Tech Blog: ygongdev.githu...
Personal Finance Resources: www.smartfinan...
Animations were custom made using 3blue1brown's animation engine.
github.com/3b1...

Пікірлер: 35
@AnupatraRuchutrakool
@AnupatraRuchutrakool 11 ай бұрын
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
@Mr2Am3 3 жыл бұрын
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
@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
@SuperBhavanishankar Жыл бұрын
I agree thank you
@freeBirbBirb
@freeBirbBirb Жыл бұрын
best video for understanding traversal BST, thank yo so much
@expansivegymnast1020
@expansivegymnast1020 2 жыл бұрын
You dropped this fam 👑
@SuperBhavanishankar
@SuperBhavanishankar Жыл бұрын
😂
@ragnarokjunekoesco7246
@ragnarokjunekoesco7246 2 жыл бұрын
By far clearest explaination on binary preorder recursion traversal, thank you!
@MeisterMattz
@MeisterMattz 11 ай бұрын
Great explanation! Your animations make tree traversals so much clearer. Thanks a lot
@afrozakhatun-pr9qj
@afrozakhatun-pr9qj 3 ай бұрын
thank youuuuu❤❤❤❤ First time i realize this topics of recursion
@BeansEnjoyer911
@BeansEnjoyer911 2 жыл бұрын
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
@Srinivasssssss
@Srinivasssssss Жыл бұрын
This animation really helped a lot...
@nwokolobueze7291
@nwokolobueze7291 2 жыл бұрын
Great explanation, the best I have seen so far. I am definitely liking and subscribing.
@kristuze1
@kristuze1 2 жыл бұрын
omg, it finally clicked to me!!!!!!!!!!! Thank you sooo much
@pelinegriboyun948
@pelinegriboyun948 9 ай бұрын
Thank you so much, this really helps!
@harishks308
@harishks308 11 ай бұрын
Great explanation..very useful 🙏😍
@ahmetokur6983
@ahmetokur6983 2 жыл бұрын
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
@ygongcode 2 жыл бұрын
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
@SuperBhavanishankar Жыл бұрын
🔥🔥😍😍🥰🥰💖💖🙏🏽🙏🏽@@ygongcode
@عمرصطحي
@عمرصطحي 2 жыл бұрын
simple explanation thank you so much man
@AkashRoy-do2dg
@AkashRoy-do2dg 3 жыл бұрын
you are a lifesaver!
@chethanvenkataramaiah6940
@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
@ayanaxhye
@ayanaxhye Жыл бұрын
awesome explanation sir
@htooaung6248
@htooaung6248 11 ай бұрын
THANK U BROTHER.
@priyanshusaxena7157
@priyanshusaxena7157 3 жыл бұрын
Such a good video....
@alperendilaver.
@alperendilaver. Жыл бұрын
excellent explanation thank you
@pal2004
@pal2004 9 ай бұрын
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?
@sheikhraisulislam4483
@sheikhraisulislam4483 Жыл бұрын
why just 490 subscription... so good
@mrcrazy1127
@mrcrazy1127 3 жыл бұрын
best video animation
@justbewizu
@justbewizu 3 ай бұрын
good bro
@CandCplusplus
@CandCplusplus Жыл бұрын
can you explain why this preorder(root.right) is automatically called for the parent node even if the pointer is at the child
@SuperBhavanishankar
@SuperBhavanishankar Жыл бұрын
Thank you
@longjieguan7275
@longjieguan7275 2 жыл бұрын
very helpful
@চর্যাপদ-ট৬ছ
@চর্যাপদ-ট৬ছ 3 жыл бұрын
good video, Can you do this for a post-order video.
@ygongcode
@ygongcode 3 жыл бұрын
Yes, it is here kzbin.info/www/bejne/aonSXnqqd86EhJI
Learn Recursion In 5 Minutes | Visualization, Code, Example
4:51
Мясо вегана? 🧐 @Whatthefshow
01:01
История одного вокалиста
Рет қаралды 7 МЛН
Enceinte et en Bazard: Les Chroniques du Nettoyage ! 🚽✨
00:21
Two More French
Рет қаралды 42 МЛН
To Brawl AND BEYOND!
00:51
Brawl Stars
Рет қаралды 17 МЛН
How Strong Is Tape?
00:24
Stokes Twins
Рет қаралды 96 МЛН
L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation
7:29
I gave 127 interviews. Top 5 Algorithms they asked me.
8:36
Sahil & Sarra
Рет қаралды 693 М.
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,3 МЛН
Morris Inorder Tree Traversal
11:44
Tushar Roy - Coding Made Simple
Рет қаралды 149 М.
Dynamic Programming: 3 consistent steps from recursive to iterative
19:52
DecodingIntuition
Рет қаралды 20 М.
Learn Tree traversal in 3 minutes 🧗
3:56
Bro Code
Рет қаралды 151 М.
Мясо вегана? 🧐 @Whatthefshow
01:01
История одного вокалиста
Рет қаралды 7 МЛН