Please Find Annotated Notes Here - shorturl.at/swB16 Please Find Practice set containing 30 questions - shorturl.at/npABT
@ishwardhande1847
Жыл бұрын
loved the use of terms "stick" , "elbow" , "mountain" than those heavy words LL ROTATION, LR ROTATION...😍🤩
@GOClassesforGATECS
Жыл бұрын
When life gives you AVL "mountain" then just grab a "stick" and march on 🏔. The best part part is you won't even get a crack in your "elbow". ❤
@ishwardhande1847
Жыл бұрын
@@GOClassesforGATECS 🤩
@devanshmaru3146
Жыл бұрын
I nearly study this concept 3 times in past but after that also learning some new things about AVL tree in this video.such a great explanation and terminology.
@aka_akaran
Жыл бұрын
Great Explanation, those stick elbows and mountains make the life easier.
@omikakadiya151
Жыл бұрын
Sir very nice way of explaining using stick , elbow and mountain Me to GoClasses : "EK hi dil he kitni baar jitoge"
@GOClassesforGATECS
Жыл бұрын
Thank you Omi Kakadiya for your appreciation. It fills us with love to see that you thoroughly enjoyed it.
@kumarshubham650
10 ай бұрын
beautiful explanation , and most important no need to mug up the formula.
@deepshikhasharma269
7 ай бұрын
Sir, other teachers just tell to cram the deletion cases of AVL trees but you have made it so easy to understand with a simple algorithm!! 💯🙏
@guruguruji726
4 ай бұрын
Amazing explanation sir. Never ever understood AVL tree like this before.. will never forget it now.
@mansikatiyar1850
Жыл бұрын
Never knew all these concepts can be so easy....thankyou sir for such great explanation!!!😁
@akashdebnath3570
Жыл бұрын
One of the best topic in DS course... Sir really made all things very much intuitive, Thank you for this amazing video ... ❤😀
@shashankaggarwal4323
Жыл бұрын
Found this topic explained very well in this video with new easy terms "Stick", "elbow", "mountain" instead of LL, LR, etc. Appreciate the efforts sir.
@AkashRoy-do2dg
Жыл бұрын
deletion of nodes in avl tree part was the absolutely Best explanation I've ever seen in youtube ! nonetheless great explanation overall
@AnanyaK99
2 ай бұрын
AMAZING LECTURE! Did not know AVL Trees can be sooooo interesting!
@abhishekprasanna5725
Жыл бұрын
Sir pls do post more such valuable content, we deeply appreciate your effort and content, thanks!
@GOClassesforGATECS
Жыл бұрын
We appreciate your feedback Abhishek. Thank you for sharing. We'll keep adding more & more quality content.
@charumehta2364
Жыл бұрын
Thank you so much sir for such a great and easy explanation..🙂
@testing2066
Жыл бұрын
To appreciate, I left a comment!
@nayanmodi8556
Жыл бұрын
AMAMZING, SIMPLE AND EASY TO UNDERSTAND, Thank you sir :)
@AshutoshPradhan-_-
Жыл бұрын
Hi guys, please note that at 10:48 --> null node (i.e. left node of 1) has a height of (-1) in this case. Hence, the balance factor of node 1 becomes (-1) - 1 = (-2). 😊
@pankajbadgujar5215
Жыл бұрын
Thankyou sir for explaining such complex concept in simple way
@abhiraj_001
Жыл бұрын
Amazing content sir.. elbow and sticks made the topic so easy instead of those LR RL LL RR things
@PUSHKIT01
10 ай бұрын
Best ever full topic on avl tree.👍💯
@DarkK_Kknight
Жыл бұрын
Even on my death bed I may forget about my whole life journey but one thing which I am damn sure I won’t forget is Avl trees….lol
@kartikeyrana3736
2 ай бұрын
this video made easy AVL for me, and after watching the node deletion part it made me go wallah walla and filled me with zeal ;)
@ex0rrr
9 ай бұрын
Wonderful lecture!!!
@shaad_iqbal
Жыл бұрын
Simple and elegant explanantion of AVL trees. You made this topic really intuitive. Thank you sir. ❤
@GOClassesforGATECS
Жыл бұрын
Glad you liked it. Your feedback motivates us.
@puspeshsrivastava4820
Жыл бұрын
Just Brilliant👌
@ayushjain386
Жыл бұрын
Best lecture ❤
@user-hd6xe6jf5o
Жыл бұрын
Nice Explanation Sir Thanks
@ujjalroy65
8 ай бұрын
awsomeeeee
@entc_khushalnikam8124
Жыл бұрын
Thank you ❤
@sutamasarkar7745
Ай бұрын
this is awsome
@eesnehhil
Ай бұрын
Thankyou 😊
@ishwardhande1847
Жыл бұрын
Thank you sir for such great Explanation😃
@2avulacharithareddy693
2 ай бұрын
Super explanation
@rushikeshsisode1533
3 ай бұрын
really a great video
@GateGeeks
Жыл бұрын
Thank you Sir for such a wonderful lecture.
@GOClassesforGATECS
Жыл бұрын
Thank you for sharing your feedback. It motivates us.
@gauravrajpurohit882
Жыл бұрын
for RR rotation the code will be like : RR_rotation(X){ struct AVLnode *temp= X-> right; x->right = temp -> left; temp->left=x; return temp} PS:-Ignore the syntax error.
@swasthikl.k2312
Жыл бұрын
Does go classes give pendrive course
@GOClassesforGATECS
Жыл бұрын
Hey @swasthikl.k2312, currently we don't offer pendrive courses. You can access our video lectures through our website and app.
@GateGeeks
Жыл бұрын
at 2:04:20 the question itself is incorrect since it is not a BST at node 12 left child is 13 which is violating the first condition of AVL Tree.
@user-gh7lv5fj4c
Жыл бұрын
yes node 13 is left of 12. sir please its typo mistake
@user-gh7lv5fj4c
Жыл бұрын
9:29 height of null node is -1 throught out AVL tree? sachin sir?
in practice set question no 11 what if we delete node 1,3,2,7 then node for is imbalance and there is elbow pattern, is it cause double rotation or not?
@adityaghosh6170
10 ай бұрын
Sir its a request if you could atleast make one introductory video on graph data structure. It would be very kind of and it would be very helpfull to us as well
@GOClassesforGATECS
10 ай бұрын
We have videos on graph data structures like adjacency matrices, lists, etc within the course. We have not uploaded all videos on KZitem, You can always enroll to watch all videos. www.goclasses.in/courses/GATE-CSE-Complete-Course
@MohddAlii
12 сағат бұрын
AVL tree- My goal is always to reach the mountain.
@chanjeevkantkumar4365
Жыл бұрын
Sir, please correct if i am wrong? , sir for minimal avl tree , we need one node at last level but that node can be child of any of the node in previous ,so every node in previous level has the chance so #nodes in minimal avl tree = 2^h
@rethickpavan4264
Жыл бұрын
There is mistake @1:02:00 the Node must be inserted on right to make it unbalanced ❤
@bholasaxena8741
Жыл бұрын
Sir there is no pinned comment for notes.
@amlanmajumdar7722
Жыл бұрын
So,If I generalize the pattern of min possible height of an avl tree with n nodes then can i say it will be floor(log(n))?
@GOClassesforGATECS
Жыл бұрын
How you are coming up with this formula?
@amlanmajumdar7722
Жыл бұрын
Just while calculating some particular case,but i have not found any counter example. like---------- 15 nodes is there, min AVL tree height possible-- 3 when 16 nodes will be there the min height will be --- 4 so, 8 nodes to 15 nodes all will be min height possible ----- 3 and from here i am coming up with this formula
@GOClassesforGATECS
Жыл бұрын
@@amlanmajumdar7722 This is not a way to drive solution. You need to solve reccurance relation.
@adityaghosh6170
10 ай бұрын
Evening sir, The question that you have made by yourself after the part-2 deletion timestamp. The question says remove 53 and then 11. Sir after deleting 53 and then after balancing the tree, 11 turns out to be the root node. What should we do in that case. If the question is telling to Remove the root node???
@eesnehhil
Ай бұрын
You should delete it the same way as you do deletion in BST. Replace it with its inorder successor or inorder predecessor. After that, balance it if any node turns out to be imbalanced.
@jupitertheinvincible7998
Жыл бұрын
2:03:02 is it even a BST? left child of 12 is 13 which is >12
@GOClassesforGATECS
Жыл бұрын
Yes right, you have the option to consider an alternative value for that position, such as 11.5. Changing the value to any other number will not affect the explanation.
@jupitertheinvincible7998
Жыл бұрын
@@GOClassesforGATECS yes sir. the explanation is amazing. operations on avl trees now seem so easy after watching this video
@GOClassesforGATECS
Жыл бұрын
@@jupitertheinvincible7998 Thanks for the appriciation. We are glad that the video helped you.
Пікірлер: 67