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.
Looks like this homie stopped the videos because there is no money in teaching for free. That means he gained wisdom and is using his knowledge to make a profit instead... Homie is getting wise.
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.
Happy Holidays 🎉 Thank you for your kind words, Delinester! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
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.
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.
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!
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.
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
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.
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!
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 )
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.
@@BackToBackSWE stackoverflow.com/questions/63649722/satisfying-properties-of-nodes-after-rotation-in-avl-trees I have this question after watching your video It would be really helpfull if you can answer it or any one reading this could answer.
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!
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
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
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 !!!!
Happy Holidays 🎉 No, you are the best Raywei! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
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! RUclips you better be listening! XD
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!
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
For 15:10 the nodes You drew and erased I think the point is they can't exist, or rather if they existed the tree would be actually balanced. Or am I missing something ?
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?
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?
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?
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
Hey man just realized I never actually thanked you, I passed my interview and your videos were so much help!!! You are awesome!
great - flourish in life friend
@TheAntloo, how many times have you used an AVL Tree in your job of two years? 🙂
@@DavidVCastro lmao
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.
haha hey
Looks like this homie stopped the videos because there is no money in teaching for free. That means he gained wisdom and is using his knowledge to make a profit instead... Homie is getting wise.
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.
This author explained AVL trees better than our professor in 2 lectures. Thank you!
Happy Holidays 🎉 Thank you for your kind words, Delinester! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
professors are like not-teaching teachers at schools stay away from them, go after assistants.
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.
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!
Haha! thanks. Try out the free mini course on our website - backtobackswe.com/
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!
Thank You, Glad you liked it.
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends :)
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.
great to hear. grow strong.
hey! im new in coding, can you explain me how did you prepare and any advices for beginers like me? i would appreciate a lot!
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
sure!!
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.
sure
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!
great
I have a test tomorrow on binary trees and this video really helped me out so thank you so much! !!
great
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 )
message us we can work something out - backtobackswe.com/contact
@@BackToBackSWE Done. Please check.
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.
Glad it helped 😄 We also have a Free 5 Day DSA Interview Prep Mini-Course - backtobackswe.com/ 🎉
This Is the crystal clear explaination of AVL trees I have seen on the Internet....!! You are awsome!!
sure yo
@@BackToBackSWE stackoverflow.com/questions/63649722/satisfying-properties-of-nodes-after-rotation-in-avl-trees I have this question after watching your video It would be really helpfull if you can answer it or any one reading this could answer.
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!
thanks and great to hear
Just few moments ago I was really missing you and your content and now your video is here!! Welcome back buddy :)
hey.
Clear, concise, and invaluable. Thank you for uploading this.
thanks - sure
Thank you, I never understood AVL trees from my university courses. Your explinations made it crystal clear for me.
I actually like you being on the frame. Helps to focus more and real lecture feeling
nice
It's definitely the best course that I've ever seen about AVL tree.
thanks
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
I found your channel smack in the middle of my data structures and algorithms class. We just started covering this. Excellent!
That is awesome!
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
Congratulations Where did you get the internship at
Yeah eger to know @Eish
Congrats mate! Keep hustling
You have a gift when it comes to explaining things!
NEVER STOP UPLOADING
OK I WON'T
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 !!!!
Glad it helped!
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
OMG SO CLEAR sooooo clear guys watch it , this is the best video for understanding the AVL tree~!
Happy Holidays 🎉 No, you are the best Raywei! We'd love to offer you a 40% Off our exclusive lifetime membership just use the code CHEER40 - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=CHEER40
I'm just commenting to help your videos rank. :) Great stuff and I appreciate all the time you have invested in this channel.
haha tru and yeah jeez its been a year, almost 2
Its hard to find a teacher who explains better than you SWE. Also, +1 on the tries tutorials would love that
thanks and ok
Thanks a lot man, my professor's explanation was needlessly complicated so this helped a lot.
Hi 👋
Haha! why don't you explore our free mini course - backtobackswe.com/
Thank you. You explained it much better than my professor
thanks
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! RUclips you better be listening! XD
thanks - we are humbled
This is the simplest vid I’ve seen on this, thanks!
Glad you liked it!
Around 11:25, when the purple tree has to be greater than y right? Since y < x and purple >= x.
Thanks
I used to hate avl trees a lot because of rotations. But this video fixed it
great.
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!
thanks! but we likely wont be able to do those. We have a lot of organizational things going on that have us busy
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
Amaze. Keep grinding!
Your tutorials save me every time!
Thank You, Glad you liked it.
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends :)
my professor literally puts me to sleep, thank you so much for this video
Haha! explore our full DSA based courses with promo code ‘RUclips40’ with a 40% discount - backtobackswe.com/pricing
Lost me when counting nodes became positive and negative @6:10 ...is it negative when you go right, and positive if left?
Hi, is this referring to balance at a node?
Back To Back SWE
Yes 😂 that is very confusing for me. All the positive 1 and negative 1 values
thank god !!.. finally you are back.. good to see you buddy
hey.
Welcome Back Brother ...Love from INDIA
love from 'MURICA 🚜🌽
@@BackToBackSWE Learnt new word "MURICA" LoL
@@adarshsharmanit356 nice
Clear yet thorough. Thank you man!
Sure!
finally a natural explanation
Absolutely stellar explanation
thx
Great video! I understand in just 20 mins which i can not do that in other video
Hey hey!!! My friend is back,
Welcome ✌️✌️☺️☺️
hey.
Very clear explanation! Is the tree at 8:30 actually a BST though? Because 0 is to the right of 2...
I think I correct it
yo welcome back!!! thanks for helping us. ;)
sure.
Dude Where are you these days, no video for 8 months........you ok buddy?
Most awaited video, thanks Benyam ❤❤
sure.
For 15:10 the nodes You drew and erased I think the point is they can't exist, or rather if they existed the tree would be actually balanced. Or am I missing something ?
I'm not sure what I said (rapid replying to comments can't go in and watch and I don't like watching myself)
The legend is back with a new video
I am normal.
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?
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?
12:45 How did we fix the balance if the tree became heavy on the other side
Yayy ! Welcome BACK Ben !
hey.
This tutorial is awesome, since there is no dislike button, I just let you know in advance !
I have a really important interview tomorrow. If I remember I’ll come here and update.
Hey, how was your interview?
Which app on iPad r u using for demonstration? Seems handy
he's back!
hey. I never left, just been working on backtobackswe.com.
Yay
Back to back is back
hey.
Welcome back, Ben!
hey.
@@BackToBackSWE Yo Ben, is the discussion section on BTB SWE still active? I've posted some questions on this video.
Your explanation was very clear, thank you very much you helped me a lot
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?
I think it's just to make the mathematical formula work, but yeah it's confusing.
Look who's back :) Great as usual Ben
hey.
Thank you so much for the best explanation I ever had.
Amaze! do try our free mini course - backtobackswe.com/
best dude ever.
Thank you man
This video really helped me to understand AVL tree! thanksssss :)
Great!
awesome video, my professor should watch these before lecturing lmao. Thank you!
lol thanks!
Wow what a sleek explanation
haha
i exited out my prof zoom lecture to watch this. thank u
haha! try our free mini course to explore more cool stuff - backtobackswe.com/
Best explanation of this 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
great. and yes.
absolutely loved the way you explain the concept here thanks a lot this really helps me
Thanks, you explained it better than my prof! xD
Can't find C++ programs for AVL on your website
What is the gear you use for making these videos? Like the quality is excellent.
I think I addressed in a different comment, but not fully sure now I forgot. iPad...mic cover...some $50 mic off amazon (Samson QC50? not sure)
@@BackToBackSWE oh.. ok thanks.
thank you very much sir. very nice explanation indeed. is there a subsequent video that demonstrate code examples?
Great video! You're a great teacher. Keep it up!
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
Great explanation. Very clear, thanks.
thanks, glad it helped! There are other codes at - backtobackswe.com/ check it out. Would love some feedback
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?
Could you not flatten the tree, get the node with the value closest to the median and set it as the root?
11:20 the purple node can't be equal to y, because the insertion condition was, smaller=left, bigger or equal to=right.
King's BACK!
I am normal, a civilian
This video saved me 40 min before my test. T
thanks!!
You are a legend.
thx
This is amazing. thank you so so much, now i know how to do rotations
which program does he use for writing?
love your video! so clear! thanks.
sure!
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
hey.
Camera: www.amazon.com/Canon-Mirrorless-Camera-EF-M15-45mm-Video/dp/B079Y45KTJ
Mic + Mount: www.amazon.com/gp/product/B07K1XSDZP/ref=ppx_yo_dt_b_asin_title_o04_s00
iPad: www.amazon.com/gp/product/B07XL7G4H6/ref=ppx_yo_dt_b_asin_title_o02_s00
Pencil: www.amazon.com/gp/product/B082V9VFFZ/ref=ppx_yo_dt_b_asin_title_o02_s01
I kind of miss him shouting near that white board.
Welcome back. ✌️
hey.
this is the best explanation
thanks
Awesome as always. Ben is Back :)
hey.
Hi I just can say thank you so much.your video was a great help to me:)
Glad to hear that :) Check out the free mini course on the website - backtobackswe.com/
Thank you thos videos are extremely helpful ! Keep going you're the best
haha! thanks. Give a shot to the free mini course on the website - backtobackswe.com/
thanks a lot this video helped me understand avl trees!
Thank You, Glad you liked it.
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends :)