AVL Trees Simply Explained

preview_player
Показать описание
The video talks about the AVL Tree data structure and how its self balancing property is implemented with rotations. It goes over insertions and deletions as well.

Code Implementation:

Visualizer:
Рекомендации по теме
Комментарии
Автор

At 2:21, I have bf=br-bl but I meant to say bl-br. Even though I wrote the formula wrong, you can see that all my calculations are bl-br. Sorry for the confusion!!

maanethdesilva
Автор

almost half of videos for avl trees, are like "RL LRrrlrllrllr right left bla bla"... This one is the best. It is simple and straightforward. Thank you.

ireneloli
Автор

Your poised and calm explanation style really helps a lot while learning!! Great video!

Shadow-cfqd
Автор

This is probably one of the most helpful videos I have ever watched. I struggled with diagramming these rotations for hours. I have a final on Friday and you just saved me!

jalenmcdonald
Автор

Bro, thank you so much! This video needs much more appreciation! This is the best AVL video so far I watched in 10 minutes

mridulbhattacharjee
Автор

You explained this so much better than both my instructor and my textbook. Really good video and super helpful!!!!

socksforfrogs
Автор

I have data structures makeup exam tomorrow and I believe that I can easily solve any AVL questions after this video, thanks to you :')

yusuftarik
Автор

This is great, I love the soft music in the background!! It really helps with exam’s stress & great and straight forward explanation!

eliaaqu
Автор

Crazy how good you were at explaining this concept

bobow
Автор

At first I had no idea what i was looking at in class. But now i fully grasp the concept awesome job i appreciate the knowledge share!!!

Penguinus-cvmz
Автор

Excellent video for explaining AVL trees in a quick and straightforward way! Only thing I would change in an updated version would be some more streamlined graphics/animations, and a new voiceover for the bf=h_L -h_R so as to not get anyone confused. Also, a quick explanation of why "Left-Right" and "Right-Left" rotations are called what they are would be nice. When we perform a "Left-Right" rotation on a node, it seems we are actually doing a right rotation on it's child, THEN a left rotation. Seems to be a bit of a misnomer in that way.

notnominal
Автор

Explained Really Well Bro, my University Teacher Didn't Explained AVL Tree This Well!!!, I'm Having Exam Tommorow of Data Structures, Thanks Man!!!

mokshgujar
Автор

got a test in like 30 min, I know it sounds impossible. But this was fully explained.

Will let you know how it goes🔥

grizzthekid
Автор

taught so much better than my CS1 professor, well done sir!

InsaneFireYT
Автор

I've been trying to udnerstand this for hours. you explained so well and I instantly grasped it and I love the style of the video. the music is helpful for me :D thanks so much. very helpful for my incoming exams please film more CS videos

kitkottin
Автор

Great conceptual explanation. One thing, at around 2:47 the formula is right height minus left height, but the rest of the video seems to flip that order. Am I being dyslexic?

zenmikey
Автор

best video I have seen on avl rotations! you're helping me ace my quiz thanks man

WrongNicholas
Автор

I must admit. I leatned thid in University. But never went on to work in Comp Sci. 28 years later ive been looking for a video to simply remind me the logic of rotations.
Only 6 mins in an its all come flooded back.

Now. I have to just go and implement it in C and i will be a hapoy man.

fleontrotsky
Автор

I really enjoyed this video, easy to follow and shows the basic well.

rodriguez.anteTee
Автор

Thanks for the video! Really helps me understand AVL Rotations! (I was struggling TT)
Can you cover Red Black Trees next?

ribbitorbit