AVL Trees Tutorial | Self Balancing Binary Search Trees

[@KunalKushwaha]

DSA + interview preparation playlist: kzbin.info/aero/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ

[@kookiechan556]

Please complete this java/dsa series not only me but many of my friends are waiting for this to complete and get placed in 2024. The best JAVA/DSA series ever. Great Job Man.

[@krishnaprasadswain7010]

Yes bro..if you complete this course as soon as possible covering all topics....then you can be free from those comments for DSA

[@insidiousop3487]

Hey bro can you help me ? I wanna know if i should do those assignments of follow a dsa sheet of other youruber

[@kookiechan556]

@@insidiousop3487 yeah, you should do those assignments those are worth it. Specially the leet code assignments provided by kunal those apply every topic's concepts.

[@insidiousop3487]

@@kookiechan556 are those assignments enough ? Do i need to do any extra than that ?

[@zanies6288]

​@@insidiousop3487you would need to do extra for clearing OAs imo.

[@SaumyaShukla118]

In the last question, the height of an AVL tree with n nodes is approximately log base2 (n) so the height should be around 10 not 3.

[@_codewithyash]

he made an mistake i guess in leftRotate and rightRotate when calculating the height of p and c.

[@DNthegamer]

Yes he made a mistake in calculating the heights after rotating it. the height I am getting is 9. Is it correct?

[@Pawansaini-e2s]

node.height = Math.max(height(node.left), height(node.right))+1; and private Node leftRotation(Node c){ Node p = c.right; Node t = p.left; //rotate p.left = c; c.right = t; //update the heights c.height = Math.max(height(c.left),height(c.right))+1;//first update c than p bez c comes to below now p.height = Math.max(height(p.left), height(p.right))+1; return p; } private Node rightRotation(Node p){ Node c = p.left; Node t = c.right; //rotate c.right = p; p.left = t; //update the heights p.height = Math.max(height(p.left), height(p.right))+1;//first update p than c bez p comes to below now c.height = Math.max(height(c.left),height(c.right))+1; return c; } check the sequence of the height of the p and c in left and right rotation

[@goutam.02]

@@Pawansaini-e2s Yeah you are correct thanks for solution

[@yashwanthraj1146]

Finally I got a one who makes things easy..😄

[@samosapoint]

You are a master in DSA. After watching your videos only got motivated to attend FAANG interviews.

[@anjalitiwari5843]

Only today I have started doing this course n was little worried because it wasn't complete but what a coincidence that you continued posting today itself . Thank you so much kunal sir for teaching in such an awesome way. You are such an amazing teacher n a fabulous person to look up to. ❤

[@shishiranjanthakur6495]

What else do you need from this bootcamp bro. Just advance data structure is remaining. But the content which is provided till now is enough for you to crack some tough coding problems. What you need more is just practicing more and more questions.

[@notjod4948]

It would be complete soon you better start today!! 😅

[@user-pj1wv1ns9x]

Sir it wud take so long there r 20 videos 1 video in a month or 4 or who nowsk

[@tanaypatel8412]

@@shishiranjanthakur6495 Kunal promised greedy and DP, so we need that too

[@zanies6288]

​@@shishiranjanthakur6495every good company asks dp questions which this course doesn't have rn

[@pranaypulipaka]

Kunal, you made understanding AVL trees incredibly simple, as always. When you mentioned shutting down your brain while coding and just writing the code based on the diagram, it really resonated with me. I even tried coding next lines before you start and that’s what makes this playlist so amazing. The small hints you drop make a huge difference in our ability to think and solve the problems.

[@KunalKushwaha]

👉 Resources - Join Replit: join.replit.com/kunal-kushwaha - AVL code: replit.com/@KunalsReplit/Trees-2-AVL

[@Study_time-gs7xm]

please complete the dsa series, we are having to shift to other sources for it, but i want to complete it from you only... u are really good in explaining and detailed and simplified as well. thank u!

[@prajapati1727]

Thank You for the amazing session @KunalKushwaha . One Observation. Examples of the 4 cases can cause confusion as to how that state of the tree came into existence. For Instance, @ 30:56, assuming that order of insertion of g-node's children is t2, t3. Then, right-left case would get executed as soon as t2 gets added as a child to g-node, and at this point, t3 is not even added to g-node. Please correct me if I am wrong in the concept.

[@RheaMochi-y1r]

After so many videos of not being able to understand AVL tree, i land up here and im stunned by how simple this was to understand. Thanks for your time and effort on this!

[@funkyboy4882]

Kunal, at 1:02:49 you calculated height of p before height of c, which is not correct, because after leftrotate p is above c, and now you are using c to calculate height of p ( because c is at left of p now) but height of c has not changed yet, so height of c should be changed first then height of p.

[@yhahahahayyyuuuqqq446]

Thanks bro, i was wondering how i got the height of the AVL = 15, whereas in the theorem, it should be log2(n) which is 9 (if we have 1000 elements)

[@shivashisharora]

Thanks Kunal for being so committed to completing this playlist, I can only imagine how you'd be managing your full-time job alongside KZbin and all the other things you do. Thanks again and god bless you. Additionally, if you ever come to Cambridge and have some free time - would love to meet you!

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@saibommakanti127]

@@Hamim-Talukdar log(1000) = 3, check again.

[@tanaypatel8412]

Please Complete this playlist ASAP, learnt recursion from you man it is amazing.

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@Soumrnjn]

@@Hamim-Talukdar you are correct bro

[@Soumrnjn]

@@Hamim-Talukdar i think something wrong in his code

[@Soumrnjn]

package Tree; public class AVL { private class Node{ private int value; private Node left; private Node right; private int height; public Node(int value){ this.value = value; } } public int height(){ return height(root); } private Node root; public void insert(int value){ root = insert(value, root); } private int height(Node node){ if (node == null){ return -1; } return node.height; } private Node insert(int value, Node node){ if (node == null){ node = new Node(value); return node; } if (value < node.value){ node.left = insert(value, node.left); } if (value > node.value){ node.right = insert(value, node.right); } node.height = Math.max(height(node.left), height(node.right)) + 1; return rotate(node); } private Node rotate(Node node){ if (height(node.left) - height(node.right) > 1){ if (height(node.left.left) - height(node.left.right) > 0){ return rightRotate(node); } if (height(node.left.left) - height(node.left.right) < 0){ node.left = leftRotate(node.left); return rightRotate(node); } } if (height(node.left) - height(node.right) < -1){ if (height(node.right.left) - height(node.right.right) > 0){ node.right = rightRotate(node.right); return leftRotate(node); } if (height(node.right.left) - height(node.right.right) < 0){ return leftRotate(node); } } return node; } private Node rightRotate(Node p){ Node c = p.left; Node t = c.right; c.right = p; p.left = t; p.height = Math.max(height(p.left), height(p.right)) + 1; c.height = Math.max(height(c.left), height(c.right)) + 1; return c; } private Node leftRotate(Node p){ Node c = p.right; Node t = c.left; c.left = p; p.right = t; p.height = Math.max(height(p.left), height(p.right)) + 1; c.height = Math.max(height(c.left), height(c.right)) + 1; return c; } public boolean isBalanced(){ return isBalanced(root); } private boolean isBalanced(Node node){ if (node == null){ return true; } return Math.abs(height(node.left) - height(node.right))

[@gauravsinghjethuri5405]

check the value of log 1000 with base 10. @@Hamim-Talukdar

[@shubhamagarwal1434]

# GOD Of DSA Hi I am a 11yr exp java guy was searching for some free course on youtube for DSA came accross your course and i just feel love in it...all in one place that too with java...i must say you have done very awsome work...your name will be there on this earth as long as DSA will be asked in interviews...May God Vishnu Bless You :)

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@mansinigam1]

@@Hamim-Talukdarlog base is 2 not 10

[@nivetha8953]

the best tutor ever in you tube.thanks for ur service.may god bless you with whatever u want , need

[@shubhambansal8794]

It's getting more cooler day by day

[@rohansunwar9784]

Such a great course but please can you deliver it in a consistent manner, you are a great teacher man, much appreciated for this course

[@KunalKushwaha]

yes will do

[@imam7652]

Please complete these sir

[@RidoyChandraDey]

I don't know what happen when I watched Kunals tutorial. It's look like very simple to understand. Thanks again.

[@aajkagyan837]

If you are struggling to understand any topic watch it again and again draw it on paper debug the code ,,,, and at last you will learnt it . THANKS KUNAL 😇

[@notjod4948]

Was Manifesting Yesterday Here we go!! Thanks Kunal for giving us your important time and content 😌!!

[@puspendra9330]

I didn't know what AVL was, but thanks to your incredible video, I now have a clear understanding of it. loved it!

[@hariharanas9702]

Thank you for posting this. I hope you find time and complete this playlist soon. Once again, thank you so much. Lots of love, Kunal ❤

[@harshit_ai]

Finally worthy content that deserves our attention

[@abdooman1556]

I've searched the internet, and yet haven't found a better video explaining AVL

[@SohelDarwajkar]

Maybe U don't know Abdul Bari.

[@NeerajSingh-mc5kf]

Earlier I was thinking to buy paid course, but u saved me, u r right no where in world i can get such DSA content, and beautiful explanation keep up good work Kunal. I am always left astounded at the level of dedication and hard work you put in every situation. May you reach every height of success!

[@AkshatJain-vn3xu]

best video on AVL trees on the internet Thanks kunal

[@karthikeyanatuva3742]

Please Compete the DP and graph series completely ASAP. Your DSA Course is very useful and perfect of all DSA courses on youtube. Please do the course with more standard problems in the respective topic.

[@laxmanprabhu9776]

1st time I saw this video in recommendations, I cross checked for the upload timings 3 times🤣. Thank you kunal.

[@yashdhanlobhe2985]

Seriously, when i was doing cp i tried a lot to learn this but i was not able to do it. I left cp and DSA one year ago and this video poped up so i thought let's give a try. And concepts are super clear i am wondering what was hard in this.😮 😮

[@theanonlearner]

didnt find any other avl tree videos useful except this. thanks kunal

[@ayushyadav1894]

Thank you so much Kunal updating this series ❤

[@thor1626]

Hi Kunal, firstly i want to say that I cannot thank you enough for this series. Secondly I have some questions: 1: Do you yourself revise these concepts before making videos, and is that one of the reason why these videos take so much time. 2: How many and what videos have you planned to upload next?

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@pratheeeeeesh4839]

@@Hamim-Talukdar😂

[@Hamim-Talukdar]

@@pratheeeeeesh4839 why you are laughing man. I already have figure out the answer. There was a single code mistake in the Kunal vi AVL tree implementation, that's why it was giving wrong answer. Actually the answer will be 9. If you fell I'm wrong then google it.

[@Rajyadav-yh3rz]

After following all the lectures .This was an easy one. Not a single doubt. Thanks kunal.

[@RiyaSingh-ke7dq]

thankyou so much the examples and your way of breaking down the creation of avial tree by adding more elements was really so simplified and i was finally able to understand with the concept of pgc everywhere it was too confusing and the number of examples that you took cleared all my doubts

[@howsthephysics5822]

Best video on KZbin for AVL the way you generalized 4 cases with parent child and grandchildren node was very helpful.

[@KunalKushwaha]

You’re welcome

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@ashishkushwaha6539]

@@Hamim-Talukdar log2(1000) = 9.96 hence the height will be 9

[@swakal8868]

Kunal Kushwaha is new Superhero. Continue like this. Can not wait for your Dynamic Programming and P-NP lectures.

[@bravekiller2557]

Take a bow to this wonderful and intelligent guy.

[@devdutdivine]

Hey Kunal you are giving great quality content which we may not get even in paid one thank very much for this I have request pls complete this bootcamp ASAP as after 2 month placement process will start and I am following your course....pls pls🙏🙏🙏

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@devdutdivine]

@@Hamim-Talukdar log(1000) == 3 check the log formula

[@Hamim-Talukdar]

@@devdutdivineHere the base of the log is 2. So log(1000) of base 2 is == 10

[@UCANBRUH]

FINALLY my man my motivator the legend is back 🎉🎉🎉🎉

[@karthikeyan.s2565]

Thanks for the next video in the series brother Keep posting these videos and complete DSA asap please ❤

[@AakashKumar-th6rw]

Arraylist ✔ String builder✔ Sorting✔ Recursion✔ OOPS✔ Linked LIst✔ Stack✔ Tree(in Progress)

[@Amitsharma-y5r6c]

"Thank you for helping me fall in love with DSA! It no longer feels intimidating, and I truly enjoy exploring it now."

[@bhaveshanandpara8474]

I had a doubt please correct me if I am wrong. AVL is self balancing *BINARY TREE* so if there are 1000 nodes shouldn't height should be [ Log 1000 base 2 = 9 ] than [ Log 1000 base 10 = 3 ]

[@KunalKushwaha]

yes, I did +1 inside bracket by mistake

[@user-nw6jx7eb8f]

I too got the same doubt

[@mohamedsaiidouertani3568]

@@KunalKushwaha thank you for all your effort you are great, but we made another misatke in leftrotate() function we should update the height of c before the height of p to get the correct height c.height = Math.max(height(c.left), height(c.right) )+1; p.height = Math.max(height(p.left), height(p.right) )+1; return p;

[@harshrajushire429]

@@mohamedsaiidouertani3568 can you tell me reason why i should update c first then p

[@AyushGupta-uq6lp]

@@mohamedsaiidouertani3568 thanks .. that was the major error .. beacuse of this algo was giving the avl tree as unbalanced.

[@dhruv8871]

Nice Kunal ....please dont stop now....Give us complete DSA n algorithms.

[@arnabchatterjee8556]

Thanks Kunal I literally completed the trees vid one day ago ..

[@fftamilan2155]

THANKS Man I did get lot more knowledge than a paid course Already I read a comment that the person said that he won't share this on socialmedia it's because It will create a mess for his placement Coz You know already this is the best course So Same here i won't also share this on social media until i get placed If i placed i will definitely recoomend it all the students I know But continue this series like dynammic programming Coz It will come in handy for the interview/Placement

[@sampriktamodak7890]

Great job Kunal.Learning DSA has become so easy watching your dsa bootcamp playlist!!! Waiting for the DP series :)

[@srisri9611]

You are teaching stuffs which colleges struggles and fails to teach. Kudos

[@AmitPatel-n8i]

Thank you kunal for such an amazing content, your DSA course is very easy and simple to understand even hard topics, your explanation is great.

[@harshiramani7274]

Please complete this java/dsa series I am are waiting for this to complete and get placed in 2024. One of The best JAVA/DSA series ever. Great Job Man

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@cadc-pn1ir]

There is a small bug in 1:02:11 . The +1 should be outside of Math.max() function. Great Explanation Sir. Enjoyed aLot. Thank you so much for this lovely content

[@nivasgopi2780]

Excellent teaching!! Genuinely intelligent!! Thank you so much, Kunal

[@areebamakhani5245]

DSA exam on Monday. You're the only help. Best ever java DSA playlist. THANKYOU MAN !!✨

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10. So, the output has to be 10. What do you think?

[@zindafossil3835]

​@@Hamim-Talukdarbro if you get the answer please help me

[@minthat7677]

I Just love the way you teach 😊Thank you so much for posting these videos

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@NoushadPatel-d8p]

Thanks man for sharing such great video on AVL, As you said balancing trees is just a piece of cake at the end of the video is so true after watching this AVL video of yours. .

[@harshit_ai]

I'm super happy, Thank you for this

[@bangtangirl1632]

Kunal 😢 you are such an angel . Thank you so much

[@gauravsinghjethuri5405]

Amazing video as always. thank you kunal please complete this playlist.

[@ashis.di.sardar]

You teach like a PRO!

[@kartikbhatt1695]

love you bro for continuing the dsa series Thanks a lot

[@gowtham9153]

59:54 A small mistake. You have incremented the height of the right node. +1 should be outside the max function. Math.max(.....)+1;

[@KunalKushwaha]

Yeah

[@yashpandey7041]

Cant wait for your DP series!!!

[@namankumarsrivastava4566]

that such a perfect playlist pls complete it soon brother!!

[@aayushsharma1106]

Thank you kunal for these amazing videos.

[@itspraskpatel]

Thanks Kunal for such a great Explanation.

[@BROOKnim]

DAMN man, its was super easy understanding this concept. one doubt/mistake. ( i believe you made this mistake in leftRotate ) when calculating height of the node 'p' (new parent) in left rotate , since 'c' (old parent) is going to beon left child of 'p' (new parent), we have to first modify the height of old parent 'c' before modifying the new parent 'p' . well this was due to the variable names where noramlly parent shouldve been 'p' but we take 'c' to make it similar to the diagram again, thanks for this amazing tutorial

[@mlvibes8310]

Thank you ❤ Bhiya, god of DSA thanks gain

[@neelphadke2531]

Great explanation, and procedure of problem solving.

[@tharunch1865]

finally kunal is back with bang, please continue this series bro

[@MeghanaJanupala]

very useful and resourceful. thanks for all the effort.

[@swakal8868]

How is that in 1:03:00 we are getting 3 as the answer. log2(1000) is near about 10. So height must be >10 ?

[@taongasoko4716]

Thank you sooo much, please continue it sir!, I appreciate it greatly

[@Ken-rj5xi]

Hey kunal!! Correct me if i'm wrong, at 59:38 the way you calculated height is wrong. Isn't it supposed to be "Math.max(height (p.left)-height(p Right))+1;" instead of "Math.max(height (p.left)-height(p Right)+1);"

[@MdSaifUddin-w7y]

if u got the ans please tellll me

[@VishalKumar-je1gq]

Very in-depth explanation nice , thank you. For high quality stuff 🙂

[@HarshithMuthangi]

Great Explanation 👍👍

[@AtharvaRao0104]

Kunal can do anything easily.. Kunal for president ❤

[@richarai828]

Thankyou so much! I really needed it.

[@JerickMamuric]

Thanks a lot for sharing this Sir! despite your busy schedule :)

[@deepakt4737]

thanks ❤ for your lectures .. was waiting for this last one month

[@spdwivedi5925]

Great video kunal bhaiya

[@Raha2003_]

I was waiting for it. I hope u upload next soon

[@prashlovessamosa]

Your channel and pepcoding are the best

[@TheShopiify]

At 39:20, i am really confused rotate right from 16 but kunal you said height diff. Of left and right sub-tress but here is no subtree. So how can we rotate from here. Looking for height from sub-tress or not. Big confusion.

[@kanyapandey]

I hope you are doing well Kunal, GOD bless you 🙏 Thank you so much for sharing your knowledge and precious time. You’re the best 👏👏👏

[@madhubabu3482]

Super brother, you are awesome, you have a great patience and explaining things to us. Thanks alot....❤❤

[@anirudhbhat1442]

at 1:04:03 i think it is height = log2(no.of nodes) not log(no.of nodes) so we should get 6.something

[@ShiviThagele-lv4si]

thanks for continuing the course

[@NivasGopiGCP]

As usual, you rocked it kunal.

[@aryansharma4509]

i am really enjoying your videos and I did to much with the help of content (it is top notch better then any paid courses ) only request is please make all other topics of DSA little fast be regular please....

[@thanirmalai]

Truly Amazing

[@satestactmathtutor6570]

finalllyyy here we goo for the next video

[@TechProcessor]

Awesome As Always and Thank You for giving your time

[@akashnag6459]

Hey Kunal, So nice of you to post this incredible content. Requesting you to please teach GRAPH and DP also.

[@Hamim-Talukdar]

Hey, the height of the tree shouldn't be 10 because log(1000) == 10, right? So, the output has to be 10. What do you think?

[@SoyebAliFaruque]

Good as expected

[@beatx2173]

Life is good when Kunal posts java videos

[@nishantagrawal6318]

Thanks Kunal for uploading it....

[@abdooman1556]

in the height calculator, u added the 1 the the node.right, rather than adding it to the result of the Math.max.

[@neilkapadia7]

Amazing Amazing explanation!!!!

[@ganeshborse5340]

at 1:03:53 the height of AVL tree for 1000 elements must be approx 10, why it comes out to be 3

[@Aditya.Rawat45]

Hey,i have the same doubt,the height is always 3 for both 1000 and 10 elements

[@PriyaSingh-zb5wn]

thanks sir..it was wonderful🙏

[@zindafossil3835]

Kunal you should pin the doubt comments after answering them so that we can find them easily ( lecture was awesome similar to linked list ) ❤