Тёмный

In-order tree traversal in 3 minutes 

Michael Sambol
Подписаться 127 тыс.
Просмотров 273 тыс.
50% 1

Опубликовано:

 

17 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 103   
@adonis1168
@adonis1168 7 лет назад
Dude. I'm serious. I got all this stuff done by looking at your video for 15 seconds. I'm about to cry from happiness. I love you.
@stathisstathopoulos9007
@stathisstathopoulos9007 4 года назад
yeet
@VatsalRajyaguru17143
@VatsalRajyaguru17143 3 года назад
Fun fact: fuck you
@horikatanifuji5038
@horikatanifuji5038 3 года назад
@@VatsalRajyaguru17143 When?
@nepthysdev2184
@nepthysdev2184 3 года назад
yo I saw your comment on the MIT 6.006 lecture 6 and then came here and saw this lol
@martint5340
@martint5340 6 лет назад
Replacing “root” with “visit” was a very subtle but great move that made it a ton more understandable. Thank you!
@paulmezie01
@paulmezie01 Год назад
I totally agree!
@overpoweredmeowmix
@overpoweredmeowmix 6 лет назад
Prof tried an hour trying to explain it when she couldve just said 'Left, Visit, Right' thank you so much
@TurskoVideos
@TurskoVideos 7 лет назад
Wow putting Left, Visit, Right next to the nodes makes it so easy!!! Thank you so much!
@Nuhjeea
@Nuhjeea 3 года назад
Love these quick videos for when I'm on the toilet... I mean when I need some fast easy-to-digest CS videos.
@sauravsahu6243
@sauravsahu6243 6 лет назад
No nonsense. Crisp and clear explanation. Thank you so much.
@LegendarySkyHero
@LegendarySkyHero 4 года назад
Thank you dude. You just helped me in my interview and possibly saved my life
@maliksafwan17
@maliksafwan17 Год назад
this is by far the best and simplest explanation I have found, thanks!
@elizabethomosura7586
@elizabethomosura7586 2 года назад
I'm here because you teach way more explainable than my teacher aaaa you're lifesaver!
@yo-qw3dk
@yo-qw3dk 5 лет назад
Thank you so much dude! I have this in my data structures exam, but my professor accidentally put C,E,D (let's say) in in-order and I was confused about it, cause she only gave us 2-3 examples with binary trees.
@lucheeno
@lucheeno 2 года назад
Somehow the best explanation to understand the in-order traversal.
@TheQuancy
@TheQuancy 2 года назад
I like thinking of pre, in, and post order traversal by the name Pre - before The node is before the left and right calls. Node, Left, Right In - inside Node is in the middle, or inside the left and right. Left Node Right Post - after Left, Right, node
@sujoyguha3790
@sujoyguha3790 5 лет назад
Dude you're fucking dank. I'm a DS student at UCB and this transversal video was so much easier to follow than the professor (who is also dank). Thank you so much for this.
@jibrilabdul2184
@jibrilabdul2184 Год назад
Spent the whole day trying to learn this.
@justyusaf
@justyusaf 6 лет назад
Michael. From this point on, you're a hero for this. Thank you so much.
@TalhaHasanZia
@TalhaHasanZia 2 года назад
Really liked about shorter and to the point video, subscribed!
@MichaelSambol
@MichaelSambol 2 года назад
Thanks, Talha!
@PaulFeher
@PaulFeher 2 года назад
I like the way the subjects are presented. I miss a link to the previous and the next videos.
@aalsolaiman
@aalsolaiman 5 лет назад
due why the hell those teachers teach it in a hard way while yours would take them 15 seconds!!!! I love you and as the one before me i will cry from happiness
@LoomaMounten
@LoomaMounten 2 года назад
Finally a simple quick explanation! Bless
@grish1u927
@grish1u927 2 года назад
Plain and simple, the visit thing is the clutch!
@BrainGuy
@BrainGuy 5 лет назад
Ohmyjesus. You're a god. The fact that this vid doesn't have 7 billion upvotes is proof that not enough humans are nerds.
@nyanRETARD
@nyanRETARD Год назад
Left visit right. I love you.
@MichaelSambol
@MichaelSambol Год назад
💪🏼❤️
@bylei6080
@bylei6080 6 месяцев назад
bro literally saved my life im cryin
@jobbaffet372
@jobbaffet372 3 года назад
Finally, a video that is actually helpful
@mrmansir3734
@mrmansir3734 Год назад
thank you this was very easy to understand with your explanation
@jamesh4129
@jamesh4129 2 года назад
Thank you. This video finally made it all click for me.
@batuhanozcan_
@batuhanozcan_ 2 года назад
MY MAN REPLACED ROOT WITH VISIT AND I UNDERSTOOD EVERYTHING LOL
@anoblefish411
@anoblefish411 3 года назад
finally, someone who speaks actual English
@Superalexandru2
@Superalexandru2 6 лет назад
Very clear explanation! Made it look easy, thank you!
@Wjdveiwlslfbeb
@Wjdveiwlslfbeb 5 лет назад
Holy molly.... you are toooo good instructor!!! thanks alot!!
@xddhuman
@xddhuman Год назад
easy to understand, great video!
@MichaelSambol
@MichaelSambol Год назад
thanks, mikey!
@supamdeepbains5172
@supamdeepbains5172 6 лет назад
keep on making this animation dope shit for like balanced tree ....helpful thanks homie
@zafarhassim8708
@zafarhassim8708 4 года назад
This video was so much help. Thank you so much.
@felunia.
@felunia. 12 часов назад
finally its the video that i understand
@Ali-qm8ix
@Ali-qm8ix 2 года назад
keep going you are the best!
@BlueSky-ho6dy
@BlueSky-ho6dy 10 месяцев назад
god bless you micheal
@vishnuumakanthan9583
@vishnuumakanthan9583 5 лет назад
Bro , thanks a Lot man...really understood the concept. Love you loads.
@shiyangnie6738
@shiyangnie6738 3 года назад
Very clear explanation, thank you.
@toastyshrimp1882
@toastyshrimp1882 2 года назад
if anyone is confused, you can also think of in line traversal as printing the node only if the node has no left children.
@lenzpaul2205
@lenzpaul2205 5 лет назад
Genius! Thaaank you for a great video sir
@darshantsdarshan1
@darshantsdarshan1 6 лет назад
I love you for this amazing tutorial video :)
@amirbeigi3670
@amirbeigi3670 Год назад
Best Video Ever
@adriandragos2953
@adriandragos2953 3 года назад
My savior !
@kinggeedora
@kinggeedora 6 лет назад
this is genius. thank you
@josephho6458
@josephho6458 3 года назад
your work is amazing. Thank you!
@MichaelSambol
@MichaelSambol 3 года назад
Thank you!
@paulmezie01
@paulmezie01 Год назад
Clear and concise explanation. Thanks a bunch!
@heesu-me
@heesu-me 4 года назад
좋은 아이디어 입니다~ dude
@최우혁-n5k
@최우혁-n5k 4 года назад
I agree! Thank you Michael Sambol. I love you
@진도화-g9u
@진도화-g9u 4 года назад
dude korean no way~
@이코리-w3b
@이코리-w3b 4 года назад
많은 도움이 되었습니다. Sambol 씨 앞으로도 좋은 영상 부탁드립니다
@emmanuelmtali1594
@emmanuelmtali1594 3 года назад
From the visual perspective "H" seams to be on the left but how does the computer knows that since its the only child of "I"
@GummyReboot
@GummyReboot 7 лет назад
Awesome explanation!
@WeirdStuffaaaa
@WeirdStuffaaaa 3 года назад
holy shit I understood It. Thank you very much
@ferieldi8137
@ferieldi8137 10 месяцев назад
It was super clear ! Great work
@dylanpoole2788
@dylanpoole2788 5 лет назад
Cheers man, wadda legend 😎
@allroadsleadtogreen
@allroadsleadtogreen Год назад
what's the pre-order traversal for the same tree?
@nahida6354
@nahida6354 5 лет назад
Wow, It's really helpful:))) now after watching many videos:|| finally I understand how it's work just in 3 min ,thank U very much >_
@ManojKumar-2606
@ManojKumar-2606 3 года назад
Hii
@JanekBogucki
@JanekBogucki 4 года назад
Very clear!
@djuka8121
@djuka8121 4 года назад
how does it know to return to a previous (parent) node?
@Ryan-xb1ry
@Ryan-xb1ry Год назад
Wow amazing
@piotrzaborowski7998
@piotrzaborowski7998 4 года назад
For fucks sake, this is what I was looking for, thanks a lot
@black_godfred
@black_godfred 3 года назад
Thanks buddy!
@noreply2030
@noreply2030 4 года назад
Nice video!
@khonzaizzati4836
@khonzaizzati4836 4 года назад
this isss sooooo geniousss
@fightforfitness2256
@fightforfitness2256 Год назад
Thank you so much.
@MichaelSambol
@MichaelSambol Год назад
You're welcome!
@maor1910
@maor1910 5 лет назад
perfect video
@ericn7975
@ericn7975 4 года назад
Link to the previous video please
@geraldmacasaet6817
@geraldmacasaet6817 3 года назад
Question: Why G is written first than H? :)
@vladislavbarbarii2089
@vladislavbarbarii2089 6 лет назад
Thank you very much
@yangwilliam3137
@yangwilliam3137 Год назад
u the goat
@andrewle9313
@andrewle9313 2 года назад
dam dude this shit is mad good
@mayelinespino2487
@mayelinespino2487 3 года назад
Thank you!!!!
@florafu2328
@florafu2328 Год назад
this is COOL
@sangaviloganathan5194
@sangaviloganathan5194 4 года назад
Gratitude!
@looploop6612
@looploop6612 5 лет назад
how does it move back to b from a?
@noakemp7403
@noakemp7403 4 года назад
Loop loop did you figure it out ? I’m asking myself the same question
@harrydo4200
@harrydo4200 5 месяцев назад
why isn't H I G like the first one A then B?
@scottkim7237
@scottkim7237 Год назад
How is it G H I, not H,I,G?
@siggimatti1129
@siggimatti1129 Год назад
Was wondering that too, I think visiting the node twice doesn't matter if you can go to the right of it instantly. The left side wasn't available for G so he could just mark it right away.
@bhavukpahuja269
@bhavukpahuja269 5 лет назад
nice video
@Max-oj9tp
@Max-oj9tp 4 года назад
Thnxxxxxxxx dude
@goblinboi9293
@goblinboi9293 3 года назад
I must have some extreme autism, cause after 15 minutes of rewatching this video, i'm still lost.
@leonleon1809
@leonleon1809 Год назад
Thanks
@MichaelSambol
@MichaelSambol Год назад
Thank you!
@王阿翰-j9r
@王阿翰-j9r 6 месяцев назад
MY MAN HELP ME TO FINISH MY DSA ASSIGNMENT
@fabrizioclomer8405
@fabrizioclomer8405 2 года назад
god
@harelperry7051
@harelperry7051 6 лет назад
i want to kiss you THANK YOU!!!!!!
@JackSikolia
@JackSikolia 5 лет назад
This is not the way
@mostafayounes9490
@mostafayounes9490 9 месяцев назад
Thank You ❤
@MichaelSambol
@MichaelSambol 9 месяцев назад
❤️
@heideralali2197
@heideralali2197 6 лет назад
Thank you so much
Далее
Post-order tree traversal in 2 minutes
2:19
Просмотров 187 тыс.
Naming Things in Code
7:25
Просмотров 2,2 млн
🤔ЗАЧЕМ ОНИ ЭТО ДЕЛАЮТ?🤦‍♂️
00:49
Learn Tree traversal in 3 minutes 🧗
3:56
Просмотров 105 тыс.
The hidden beauty of the A* algorithm
19:22
Просмотров 872 тыс.
Мой протез взломали хакеры
11:36
Level-order tree traversal in 3 minutes
3:20
Просмотров 47 тыс.
LeetCode was HARD until I Learned these 15 Patterns
13:00
8 patterns to solve 80% Leetcode problems
7:30
Просмотров 396 тыс.