This kid's older brother is one of my little homies from college. Now i'm reviewing algorithms and the little little homie is teaching me. Both impressive young men who are making their families proud.

Hey man just realized I never actually thanked you, I passed my interview and your videos were so much help!!! You are awesome!

Check out the free DSA Mini-Course 👉backtobackswe.com/five-day Table of Contents: Introduction 0:00 - 2:07 Tree Height 2:07 - 3:51 Node Balance 3:51 - 4:21 Balance Calculation Practice 4:21 - 7:32 Breaking The AVL Property 7:32 - 8:32 Rotations 8:32 - 12:52 Right Rotation 12:52 - 15:58 Left-Right Rotation 15:58 - 18:12 Left Rotation 18:12 - 18:50 Right-Left Rotation 18:50 - 19:44 Support Us At backtobackswe.com 19:44 - 20:37 Errors: 0:19 - 1:41 The is not a BST, this is fixed at 1:41. 11:08 NIT: The purple triangle is > y (strictly greater) and > x I hope this helps someone. If there are any mistakes let me know and I'll update the "Errors" section.

Just few moments ago I was really missing you and your content and now your video is here!! Welcome back buddy :)

This is the clearest explanation I have seen on Balanced Trees so far. I was trying to learn this topic back in march and I could not find a good resource to understand and I dropped this topic. Now today I picked it back up and I found your video. Thank you so much !! ---> Subscribed

Thank you for this video! finally I understood AVL trees!! I will keep commenting each video I see that helped me to keep supporting you! you are great!

First time here. Was searching info about AVL, had problems with understandings it. And occasionally find this channel. Man it is incredible. Totally awesome. It's so clear for me after your explanation. I've also checked the list of your videos. And I am joining this great channel and will advise it to my friends! Thanks for the content!

Started BSTs in class and we have to implement our own AVL tree. The textbook didn't cover left-right or right-left rotations nearly as well as you did. Thanks so much for this video, I will be citing this in my project.

Before i watch the video again gotta let you know, this was hands down the best illustration ideo for AVL trees. The illustrations are easy to follow. Cheers.

The clarity of your explanation is astounding. Thanks a bunch!

Clear, concise, and invaluable. Thank you for uploading this.

OMG the way you explained it around 12:30 makes so much sense. I don't need to memorize anything, I just need to think through whether each triangle is less than or greater than x, and the same thing for y, and then it's so easy to perform the rotation. Thank you!

As always, why is that some guy on youtube can explain these concepts so much better, and in a shorter amount of time than most college professors? It boggles the mind.

Hey you probably get this a lot, but you helped me so much to prepare for my interview. I have been non-stop preparing for my coding interview at my dream company at Microsoft. I've been prepping 8-10 hours a day every single day on LeetCode and watching your videos. You have helped me so much in learning the fundamentals and learning how to approach different coding problems. I'm glad to say that I did get an offer from Microsoft yesterday! Again, I thank you so much. Your videos were the main reason I was able to get this offer. You have truly changed my life.

I got a Microsoft SWE II position from your awesome videos! Thank you so much for your videos, I really don't think I would have been able to do it without you.

Perfect explanation of AVL rotation !! I've watched the videos about this subjet in French, Korean and English. And only your video makes me understand CLEARLY and PERFECTLY. Thank you so much.

I have a test tomorrow on binary trees and this video really helped me out so thank you so much! !!

I found your channel smack in the middle of my data structures and algorithms class. We just started covering this. Excellent!

I lost my job due to the covid-19, now learning and prepping for Tech interviews. Life is tough these days. Also, please please upload more videos on Linkedlists . ( all if possible - from start to end )

absolutely loved the way you explain the concept here thanks a lot this really helps me

Thank you, I never understood AVL trees from my university courses. Your explinations made it crystal clear for me.

I've never waited eagerly for the next video of any of the youtube channels literally except yours. Every syllable of your explanation makes sense and is very clear. I wanted to request video for few leetcode problems, try to include these in your line-up. Dungeon Game, Path Sum III, Frog Jump. Thanks in advance!

I actually like you being on the frame. Helps to focus more and real lecture feeling

I know this video came out awhile back but if you see this, thank you so much! I just didn't understand it in class and when my professor explained it again to me. You literally made this such an easy concept to get!! Thank you !!!!

Clear yet thorough. Thank you man!

yo welcome back!!! thanks for helping us. ;)

I'm just commenting to help your videos rank. :) Great stuff and I appreciate all the time you have invested in this channel.

THANK YOU SO MUCH FOR THIS VIDEO!! Very well explained and clear :) Helped me a lot!!!

Thank you, it definitely helped alot but still i cant figure how do i determine if i need a left or a right left rotation? Like on what do i have to look to know which to use?

NEVER STOP UPLOADING

Benyam, you are PRO man! I am fan of your teaching style! Your videos have helped me a lot in my prep. Now I have come back for yet another interview, going though your videos first for a quick learning. May this channel be in everyone's recommendation! KZfaq you better be listening! XD

After spending 12 hours non-stop trying to fix just one bug in my AVL tree (with parent node pointers) I've decided to take a step back and watch this video, and this is so much help! I am going to try again now after eating

Dude Where are you these days, no video for 8 months........you ok buddy?

It's definitely the best course that I've ever seen about AVL tree.

This is the simplest vid I’ve seen on this, thanks!

Hey man, don't comment alot but I just wanna thank you for being a big part in me getting an internship. The work you do is invaluable, and I for one really appreciate it. Keep grinding these out, you got a life long sub in me

This Is the crystal clear explaination of AVL trees I have seen on the Internet....!! You are awsome!!

Around 11:25, when the purple tree has to be greater than y right? Since y < x and purple >= x.

OMG SO CLEAR sooooo clear guys watch it , this is the best video for understanding the AVL tree~!

Best explanation of this thank you!

thank god !!.. finally you are back.. good to see you buddy

Hey buddy, you are amazing. Surprisingly I could end up with a solution to a Salesforce coding interview. All with the method of thinking and approach that you convey.. I dont think I would ever get the crux with any other site. Thanks a lot . Please keep posting videos , would love to hear you

This video really helped me to understand AVL tree! thanksssss :)

Hey hey!!! My friend is back, Welcome ✌️✌️☺️☺️

Hi I just can say thank you so much.your video was a great help to me:)

my god i understood his explaination and i feel fun doing this work it kinda feel like rubiks cube. this channel is a magic of understanding

short and precise thank you

Thanks for the great explanation

Your explanation was very clear, thank you very much you helped me a lot

Your tutorials save me every time!

Thank you, great explanation!

best dude ever. Thank you man

Hey! I’m also a UMD student, great video! I was wondering what camera do you use to record and what mic do you use? Thank you

Thank you for this amazing video!

Very nice! Thank you!

thanks a lot this video helped me understand avl trees!

love your video! so clear! thanks.

Great video. Quick question though: Typically to calculate balance factor should we not do height of right - height of left. This way if its a left heavy tree you can tell because the balance factor will be < -1 and a right heavy tree will have a balance factor > 1?

oh wonderful explanation, tysm !!

Which app on iPad r u using for demonstration? Seems handy

This is amazing. thank you so so much, now i know how to do rotations

what is high of tree when on right side i see 2 nodes and left 2 nodes plus 1 note on the top? H(Tr)+1=2+1=3?

Great explanation. Very clear, thanks.

Most awaited video, thanks Benyam ❤❤

finally a natural explanation

Absolutely stellar explanation

Very clear thanks!

awesome video, my professor should watch these before lecturing lmao. Thank you!

Hey bro , I have loved your teaching methodology , I have started visualising the algorithms , I love you man thank you so much. Could you try to cover up segment trees if possible

thank you very much sir. very nice explanation indeed. is there a subsequent video that demonstrate code examples?

Thank you thos videos are extremely helpful ! Keep going you're the best

Thank you so much for the best explanation I ever had.

Thank you. You explained it much better than my professor

Thanks I used to hate avl trees a lot because of rotations. But this video fixed it

Yayy ! Welcome BACK Ben !

Very clear bro, thank you

Love this video

Great video! You're a great teacher. Keep it up!

Thanks a lot man, my professor's explanation was needlessly complicated so this helped a lot.

Look who's back :) Great as usual Ben

Wow what a sleek explanation

Could you not flatten the tree, get the node with the value closest to the median and set it as the root?

Thank you very much bro

Thx a lot!

Thanks, you explained it better than my prof! xD

Very clear explanation! Is the tree at 8:30 actually a BST though? Because 0 is to the right of 2...

Thank you man

Its hard to find a teacher who explains better than you SWE. Also, +1 on the tries tutorials would love that

this is the best explanation

8:00 From what I understood previously, the first node is "0", then going down from there, whether left or right, it is increased by one. Why does he only start "0" at the second nodes instead of the first one?

This is a great video!

so clear! Thank you!!!

12:45 How did we fix the balance if the tree became heavy on the other side

helping me through data structures

he's back!

amazing video!!!

Awesome as always. Ben is Back :)

helpful vid dawg

Great work!

my professor literally puts me to sleep, thank you so much for this video