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.
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!
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.
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
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
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
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.
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
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 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 !!!!
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! TH-cam you better be listening! XD
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 )
Happy Holidays 🎉 Thank you for your kind words, Wrongnicholas! 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
right in 6:09 I decided to just pause and get to code to see if I can understand it. I ended up with something not very stable but it works XD Done in Python, I'm not sure if this may be O(n log n), it prolly depends on how bad the tree that is traversing is class Node(object): def __init__(self, data=None): self.data: object = data self.left: Node = None self.right: Node = None def get_height(b: Node): def inner(b: Node): if b is None: return -1 return max(inner(b.left), inner(b.right)) + 1 return abs(inner(b.left) - inner(b.right))
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
Thanks bro....this is a great content. It will be useful if we have an example where we have say 5 or greater number of nodes and left or right right heavy with left->right or right->left rotation explained. Again, many thanks for this content. You just rock.. Another suggestion is whether we could explain some practical applications of each DS/Alg as and when you cover them in each video. Like now I know what is AVL tree's properties-> Self balancing. Now where is this Self balancing mandatory in some real world problems. Yes we could google this out or get from intuition. But it will be good conclusion to any video you present, once you have this explained. Again, just a thought. Not an absolute requirement. Thanks Bro. Have a good one!
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?
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.
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? 🙂
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.
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 :)
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.
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!!
The clarity of your explanation is astounding. Thanks a bunch!
Haha! thanks. Try out the free mini course on our website - backtobackswe.com/
I have a test tomorrow on binary trees and this video really helped me out so thank you so much! !!
great
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
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
NEVER STOP UPLOADING
OK I WON'T
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.
I actually like you being on the frame. Helps to focus more and real lecture feeling
nice
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/ 🎉
Thank you, I never understood AVL trees from my university courses. Your explinations made it crystal clear for me.
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
It's definitely the best course that I've ever seen about AVL tree.
thanks
Its hard to find a teacher who explains better than you SWE. Also, +1 on the tries tutorials would love that
thanks and ok
Dude Where are you these days, no video for 8 months........you ok buddy?
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
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
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!
Thank you. You explained it much better than my professor
thanks
Thanks
I used to hate avl trees a lot because of rotations. But this video fixed it
great.
my professor literally puts me to sleep, thank you so much for this video
Haha! explore our full DSA based courses with promo code ‘TH-cam40’ with a 40% discount - backtobackswe.com/pricing
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! TH-cam you better be listening! XD
thanks - we are humbled
Welcome Back Brother ...Love from INDIA
love from 'MURICA 🚜🌽
@@BackToBackSWE Learnt new word "MURICA" LoL
@@adarshsharmanit356 nice
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
I have a really important interview tomorrow. If I remember I’ll come here and update.
Hey, how was your interview?
awesome video, my professor should watch these before lecturing lmao. Thank you!
lol thanks!
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/
This tutorial is awesome, since there is no dislike button, I just let you know in advance !
finally a natural explanation
This is the simplest vid I’ve seen on this, thanks!
Glad you liked it!
Best explanation of this thank you!
The legend is back with a new video
I am normal.
thank god !!.. finally you are back.. good to see you buddy
hey.
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
yo welcome back!!! thanks for helping us. ;)
sure.
Absolutely stellar explanation
thx
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.
helping me through data structures
Happy Holidays 🎉 Thank you for your kind words, Wrongnicholas! 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
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 :)
Wow what a sleek explanation
haha
right in 6:09 I decided to just pause and get to code to see if I can understand it. I ended up with something not very stable but it works XD
Done in Python, I'm not sure if this may be O(n log n), it prolly depends on how bad the tree that is traversing is
class Node(object):
def __init__(self, data=None):
self.data: object = data
self.left: Node = None
self.right: Node = None
def get_height(b: Node):
def inner(b: Node):
if b is None:
return -1
return max(inner(b.left), inner(b.right)) + 1
return abs(inner(b.left) - inner(b.right))
still figuring out how to implement the rotation btw, ended in either a stack overflow or loosing a bunch of nodes along the way
Great explanation. Very clear, thanks.
thanks, glad it helped! There are other codes at - backtobackswe.com/ check it out. Would love some feedback
Thank you - this was great!
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.
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
Im literally having my data structures exam in 10 hours and this video is saving my ass
Hope it went amazingg 🎉 Please enjoy a special coupon from us - backtobackswe.com/checkout?plan=lifetime-legacy&discount_code=SUB 🚀
absolutely loved the way you explain the concept here thanks a lot this really helps me
short and precise thank you
he's back!
hey. I never left, just been working on backtobackswe.com.
holly crap your explanation is spot on! thanks a lot
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 :)
I kind of miss him shouting near that white board.
Welcome back. ✌️
hey.
Thank you so much for the best explanation I ever had.
Amaze! do try our free mini course - backtobackswe.com/
In english, LR and RL rotations are so intuitive! In Portuguese, I'm struggling to get what the heck a "double left" rotation looks like...
Thanks bro....this is a great content. It will be useful if we have an example where we have say 5 or greater number of nodes and left or right right heavy with left->right or right->left rotation explained. Again, many thanks for this content. You just rock.. Another suggestion is whether we could explain some practical applications of each DS/Alg as and when you cover them in each video. Like now I know what is AVL tree's properties-> Self balancing. Now where is this Self balancing mandatory in some real world problems. Yes we could google this out or get from intuition. But it will be good conclusion to any video you present, once you have this explained. Again, just a thought. Not an absolute requirement. Thanks Bro. Have a good one!
sure - ok, and u too
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
best dude ever.
Thank you man
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?
Amazing explanation, yet a code breakdown would really come in handy (btw, still no C++ solution at the site)
noted and noted
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 😀
please do a video on explaining the red black tree.....and comparision of red black tree and avl tree
maybe.
love your video! so clear! thanks.
sure!
THANK YOU SO MUCH FOR THIS VIDEO!! Very well explained and clear :) Helped me a lot!!!
Yay
Back to back is back
hey.
Around 11:25, when the purple tree has to be greater than y right? Since y < x and purple >= x.
Yayy ! Welcome BACK Ben !
hey.
Look who's back :) Great as usual Ben
hey.
oh wonderful explanation, tysm !!
please make a video on boolean parenthesization problem
I love you, you are my G.O.A.T.!!!!!!
haha! thanks
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/
Thx a lot!
You are a legend.
thx
Very clear thanks!
Thank you, glad you liked it 😀
Do check out backtobackswe.com/platform/content
and please recommend us to your family and friends 😀
Very nice! Thank you!
King's BACK!
I am normal, a civilian
thank you very much sir. very nice explanation indeed. is there a subsequent video that demonstrate code examples?
Love this video
thanks
12:45 How did we fix the balance if the tree became heavy on the other side
Thank you very much bro
i have an exam about his stuff in like 3 hours. lmao. lets goo procrastination gang
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.
what i understand is we will not get a AVL when a leg is crooked. at first we have to straighten the leg then we should rotate to get a AVL
Awesome as always. Ben is Back :)
hey.
Sir, I want to join your course
When will course start or can I join whenever I can?.
Is there any discount for the course?
It is just a perpetual service. We do not have any open discounts, but we have an email list we send discounts to sometimes.
Thank you man
nice nice you are back
I was always here. Just coding and working on our service most of the time. Found a gap to post something.
Great work!
Thx
Nice
you should have told general situation in which R-l rotation and L-R rotation are done
I actually tried to solve self-balancing all myself, and surprisingly my idea of balancing the tree was exactly the same as rotation!
I noticed that your second tree isn't a BST so it couldn't be an AVL tree anyway, but that is nitpicky I guess lol.
I think I cite that in the notes? Don't remember but thx