7. Binary Trees, Part 2: AVL

7. Binary Trees, Part 2: AVL

MIT OpenCourseWare

2 года назад

67,104 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

CmdrPike
CmdrPike - 14.09.2023 16:45

Already watched this?

Ответить
Eqfira
Eqfira - 08.03.2023 08:41

O my god

Ответить
Dmitry Stepanov
Dmitry Stepanov - 30.08.2022 23:38

THE BEST LECTOR

Ответить
leila mashayekhi
leila mashayekhi - 30.07.2022 13:37

Very good. Thank you for uploading the video, But cameraman you could have been better for sure. I get dizziness😉.

Ответить
karthik Karthik
karthik Karthik - 08.06.2022 20:40

who is your favourite out of 3 gems ?

Ответить
VlogStalkers
VlogStalkers - 13.05.2022 22:44

This is highly useful! Thank you for uploading this video!

Ответить
MyTech
MyTech - 02.02.2022 02:19

So balance the lowest sub-trees first then work up.

Ответить
Lucifyer
Lucifyer - 06.01.2022 22:42

Thank you for uploading this lecture!

Ответить
Suhanee Mavar
Suhanee Mavar - 12.12.2021 18:35

Question: If height can be the property that can be stored in each node , then why not depth can be stored ? It's written that Index and depth we can't store in node bcz they are global properties

Ответить
vetofthenet
vetofthenet - 26.11.2021 08:48

They do AVL in an intro to algorithms course? Holy smoke, their level is so high.

Ответить
Ryan Jin
Ryan Jin - 12.11.2021 07:48

what does skewness mean

Ответить
zoe feng
zoe feng - 01.10.2021 17:33

I was hesitant to watch the newer version cuz the older ones were so classic but those newly released lessons didn’t disappoint me at all!

Ответить
2K20_SE_161_Vishal Roy Roy
2K20_SE_161_Vishal Roy Roy - 18.09.2021 22:04

the way he teach is outstanding 🙂🙂

Ответить
imspzero
imspzero - 18.09.2021 03:45

Epic!

Ответить