Тёмный

Merging Leftist Trees Tutorial 

Michael Mroczka
Подписаться 760
Просмотров 38 тыс.
50% 1

NOTE None of my videos contain working code on implementing their topics. They are just designed to teach you about the topics and help prepare you for an exam on the topic by explaining the theory behind each one.

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

 

31 мар 2015

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 29   
@eirinopa2347
@eirinopa2347 2 года назад
Thank you for the video! I had a question about leftist tree on exam and your video helped me
@jjordano4127
@jjordano4127 4 года назад
thanks to you finally ive got the notion of the leftist tree. i really appreciate you
@parbelloti3767
@parbelloti3767 5 лет назад
Best explanation that i've ever seen , good job 👍🏻
@zaid3726
@zaid3726 8 лет назад
first time i have liked a youtube video, cuz it made leftist tree or (heap) so simple to understand, i was trying to understand it from last one hour. Thanks..post more videos
@larryparker7081
@larryparker7081 8 лет назад
+Zaid Irfan I agree, this was a perfect video on the matter
@ashwinnishad1741
@ashwinnishad1741 6 лет назад
Easy to follow, great job!
@wmcphail
@wmcphail Год назад
Best explanation; thank you so much!
@mustafasaleh5999
@mustafasaleh5999 6 лет назад
Thank you very much, really it's pretty nice explanation
@yPokeKiller08
@yPokeKiller08 5 лет назад
Thanks, this saved me alot of time.
@sheridan.mp3
@sheridan.mp3 4 месяца назад
Thanks Mike, you're a true gamer.
@luis2arm
@luis2arm 7 лет назад
nice video (Y) nice tools. thanks and good job
@yajatvishwakk6744
@yajatvishwakk6744 2 года назад
Beautiful!
@jasondeb2678
@jasondeb2678 4 года назад
really helpful post, keep it up
@xinyuanzhang9826
@xinyuanzhang9826 8 лет назад
It is really helpful
@mayanktyagi4547
@mayanktyagi4547 3 года назад
Thanks man 👍🏻👍🏻
@tobeskid
@tobeskid 9 лет назад
Great video! very easy to understand. I'm just curious, what are you using to make the video, a surface?
@michaelmroczka9171
@michaelmroczka9171 9 лет назад
Thanks for the compliment! And I'm using a surface pro 3. I love my surface and it is fantastic for videos and school notes. I'm also using Microsoft expression 4 as my recorder.
@tobeskid
@tobeskid 9 лет назад
Michael Mroczka Nice! thanks for the quick response.
@LikhithaMenda
@LikhithaMenda 8 лет назад
That`s an awesome explanation.... i got it in few minutes... thank you very much... by the way... What is the editor You used to write, cut and paste the text shown in this video?
@shraddheyashendre9026
@shraddheyashendre9026 7 лет назад
It's Microsoft OneNote.
@LikhithaMenda
@LikhithaMenda 7 лет назад
thankyou very much
@sruthygiridharan3186
@sruthygiridharan3186 3 года назад
22 has rank 1 right.. Please just recheck and clarify my doubt.. Since 22 has 5 as a child its rank will be 1 right??
@mckayzabriskie
@mckayzabriskie 4 года назад
Good video! Turn on 1.5x speed!
@DL305
@DL305 9 лет назад
4:19 Aren't 8 and 32 actually 1 away from NULL?
@michaelmroczka
@michaelmroczka 9 лет назад
DL305 It depends on how you want to look at it. I say they are 0 away from NULL since the next thing IS null. But with that said, if you're more comfortable saying they are one away from NULL you could do it that way, but that means 36 would be 2 away from null, and so on. Hopefully that makes sense!
@umarmaniyar3807
@umarmaniyar3807 3 месяца назад
🎉
@jonathanharoun5247
@jonathanharoun5247 3 года назад
This video feels way shorter than 9 minutes
@neelaramesh3765
@neelaramesh3765 6 лет назад
this does not follow the basic rule where we first compare the roots and take the smallest root
@ritwiksathe3786
@ritwiksathe3786 5 лет назад
this is because it is a max heap, not a min heap
Далее
Binary Trees - Data Structures Explained
10:18
Просмотров 120 тыс.
Merging Leftist Trees - More Examples
10:04
Просмотров 13 тыс.
Я КУПИЛ САМЫЙ МОЩНЫЙ МОТОЦИКЛ!
59:15
Data Structures: Heaps
10:32
Просмотров 1,2 млн
I gave 127 interviews. Top 5 Algorithms they asked me.
8:36
Articulation Points Tutorial
9:35
Просмотров 16 тыс.
B-Tree Tutorial - An Introduction to B-Trees
12:20
Просмотров 321 тыс.
Tarjans strongly connected components algorithm
37:45
Top 7 Data Structures for Interviews Explained SIMPLY
13:02
Leftist Trees
14:31
Просмотров 19 тыс.