AVL Trees Simply Explained 

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!!

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.

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

bro is chill af

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

Crazy how good you were at explaining this concept

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!

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

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

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!!!

Really appreciate your efforts man!! Very well explained 👍

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

i understand this topic much better now. thank you!!

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

Great explanation!! Thank you

Amazing explanation!!

Amazing vid man. Got Data Structures II tomorrow and this really helped

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

thanks a lot man you just made this crystal clear

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

great video, easy to follow!

Amazing explanation!

Thank you for making this video !!!

Perfect explanation!

Great video, thank you!

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.

this is amazing, very good sir.

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

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

Amazing man! can't thank you enough!

Literally The best❤ tysm

loved it. Made me understand it better :)

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

you are GREAT bro , I really Hope You are Happy 🤝

Amazing explanation

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.

really good vid keep it up bro

got a test in like 30 min, I know it sounds impossible. But this was fully explained. Will let you know how it goes🔥

Wow this video just saved me

great video

Amazing!

thank you bro good video

Thanks a lot ❤

Thank you bro!!!

You're the best

Good one.

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?

I notice some people saying the balancing factor is (h_L - h_R). Is this an error?

ur the goat my g

thank you mister

chillest mf on the internet, love your content boy!

you are the god of avl tree

How would I balance this avl tree? You dont give an equivalent example, if I followed steps at 10:07 it would still be unbalanced 30 / \ 25 40 / \ 35 45 / 34

in the deletion portion, why is the 2nd to last unbalanced tree, why does 2 have a balance factor of -2 instead of a positive 2 since it's on the left side?

Question: at 6:55 you wrote LR rotation on the arrow. Isn’t that wrong? You explained it to be a RL rotation before.

7:56 how 19 balance factor is -1 after inserting 99? there are 2 left children of 19 (9 and 18) and on the right it has 4 (63, 27, 108, 99) so it is 2 - 4 = -2? how did it become -1?

The course is interesting

Music is so soothing Can I get music link or name

cảm ơn kiến thức

11:00 fir the balance factor of node 2; how is it -2? it has children on left side bf = hl - hr ; bf = 2-0 = +2 not -2 i think

9:20 is that really right rotation?

What app and device you are using in this video to write?

I noticed that the height of a node can be different, counting bottom to top from the left and right sides, is it just me? What am I not seeing?

Thanks

Why the bounce factor for 63 is +2 ?

My professor uses right - left for Bf, just as long as you keep track of which should be - and which + it doesn't matter.

@7:58 why was the root 19 still -1 .. should it have been -2?

4:36 should be right left rotation, and not left right rotation, can someone confirm?

2:07 Why you write height in red first then when you try to determine BF, you wrote the height in blue and automatically minus 1 and said not to be confusing.

Splay trees next please!

thx bro

I think this video could do a better job explaining how assigning heights to the sub-trees works. I am having a lot of trouble doing that for some reason. Maybe it's just me.

Theres a ticking sound, like the hand of a clock, playing in the background of your video. Thought you should know.

9:22 isn't it a left rotation?

What application is that?

thank you for explaining about left-right and right-left rotation, my code doesn't work because of this.

pretty sure you explain right-left rotation on the left-right explanation

at 7:45 after adding 99, wouldn't the tree be more balanced if 27 was the root? then the left and right subtrees would each have three elements, and the max height of the tree would be 3, instead of 4.

very nice vid ^^ just the music is a lil too loud

Its right - left in my class so i guess both is possible

i didnt understand nothing

Excellent explanation of concept i understand very little from your voice because it too fast 😂

seems like it should be clear from the explanation... but the balance factor explanation feels rushed. how are you getting those numbers from Height of Left - Height of Right?

Nice video but you were constantly messing up the balance factors, doing LH - RH instead of RH - LH

In 9.20 min you said right rotation,but I think it's left.confirm that once

YO BRON THAnks to you i will pas my exams you realloy helpedm e so much i need to get a 65 on my finalos i hop e i will get tit bro

That is a every nice explantation. But you made few mistakes with the calculation of balance factor. Like in last example, they are 1 and 2 so we do the right rotation. But thanks you

are you indian or mexican ijbol but whatever thanks i luv i luv i luv ur video

are you a student? where are you from what do you do? you are amazing at explaining

in the last example, 11:01 the bf should be positive! thanks

Why did mans not even explain what an AVL tree is? Also, a binary tree isn't a binary search tree. But a binary search tree is a binary tree.

I wish you become a millionaire

why music on educational video ?!

do your hair before recording

ty