AVL Tree Insertion Example(2 Solved Problems) with Diagram & Explanation | AVL trees - DSA

[@vijaybhame6773]

Sir In last insrtion of 99 You forgot to take 44 which was there in previous step, and after inserting 99 the tree is automatically balanced so no need of further rotation..... please check it once.

[@pranaygupta5911]

Yeah Exactly 👍

[@adityarajdangi6293]

It happens sometimes 🤣

[@Movies-tj7gd]

exactly

[@kedareswarp7402]

exactly bro you are right.

[@Pepperrinooo]

Exactly

[@AlokTP]

Best explanation. Best educator.

[@JohnKlaven]

Wow thank you! I have a test on thursday and this cleared up some questions. I appreciate it!!

[@burhanmirza860]

Appreciated man all these videos are best !

[@dooooooom-y8l]

you did a mistake at adding 99 you forget about 44 that was child of 35 and you missed that because of that your tree got imbalance at 55 but still you're king and you helped me alot with oop and dsa thanks for the efforts you have done for all of us lots of love from Pakistan

[@g.mzesan8649]

Just Amazing... What a video explanation.. It was a very helpful video..

[@SimpleSnippets]

Glad you liked it

[@dipteshwarule2811]

Sir your videos are awesome and self explanatory...💯💯

[@SimpleSnippets]

Thanks a ton

[@bingkysskiliwaax7941]

Hello sir, ty for your clear tutorials as usual. I hope you can teach us machine learning in the future.

[@SimpleSnippets]

Will check and see if I can collab

[@basic5071]

best tutorial here are the points: - we will perform rotations when balanced condition is not satisfied - in right rotation of 3 nodes, central node becomes parent node(new root node) and top node becomes right child = left left imbalance - in left rotation of 3 nodes, central node becomes parent node and top node becomes left child = right right imbalance - critical node is the node whose balance factor is neither 1,0,-1 - remember when we are doing rotations we should consider imbalanced node and 2 nodes below it - imbalanced node will be lower node ( if 2 and -2 are 2 imbalanced nodes, we will consider node with -2(lower)) - balance factor = left - right - how to detect LR or RL cases - LR case is left and then right turn from 1st to 3rd node : we do LR rotation - RL case is right and then left turn from 1st to 3rd node : we do RL rotation - in LR rotation : 3rd becomes parent node or new root node(top), 1st node becomes right child (consider nodes as 1,2,3 from imbalanced node) - in RL rotation : 3rd becomes parent node or new root node(top),1st node becomes left child - *bottom node becomes root node #peace is my favorite line

[@enassirfan2256]

thankyou so much for this. I really appreciate it

[@omkarshirsath629]

Nice explanation brother..You just missed value 44 at the end..But nicely explained.

[@-GuptaRahul]

Sir you forget to add 44 in the final AVL Tree

[@shivakumary7839]

yes he forgot to add 44

[@alloydsaviomendonca173]

hey at 43:44 i guess you have missed to attach 44 to 35 , so if you attach i feel 55 will be balanced, do check it out

[@SimpleSnippets]

Yeaah I missed that

[@BACSShaileshShettar]

@@SimpleSnippets so after inserting 99 it remains balanced right?

[@sayalbaig6296]

yes sir@@BACSShaileshShettar

[@ManishSharma-fi2vr]

Thank You For Your Efforts.

[@SimpleSnippets]

Welcome!

[@dushyantjakhar1716]

We Love You bro, You doing amazing job

[@dipteshwarule2811]

Can you please upload the videos related to TBT and Code related to graphs like DFS,BFS,Minimum Spanning Tree using Prims and Kruskals Algorithm,Shortest Path using Dijkstra's algorithm. Your lectures would help most of the people as these topics are somewhat difficult to implement.

[@ponradhakrishnan701]

great explanation bro keep going... keep doing...

[@garv1177]

Amaizing explanation. Loved it!!!

[@SimpleSnippets]

Glad you liked it!

[@garv1177]

@@SimpleSnippets your explanations are realy clear sir this is helping me alot in understanding AVL trees and also BST logics. 🙏 thank you for this playlist I hope you will keep on spreading knowledge like this and helping students like us❤

[@SimpleSnippets]

Thank you so much buddy for such wonderful words. Yes will keep sharing my knowledge via this channel. One request to you is please share the videos and channel with your friends too ✌️

[@dangerbirb4981]

Great explanation!

[@sheetalsahu4759]

u missed 44 somewhere in midst, btw loved the explanation

[@shubhamsandanshiv515]

Nice explanation 💯

[@SimpleSnippets]

Appreciate it

[@bharat_2020]

42:22 you forgot to add 44 node..but nice video ..keep it up

[@SimpleSnippets]

Yes, you are right

[@semihaturkoglu]

great explanation

[@abhinav_wav]

You missed 44. This is the problem when you do it all alone... I guess🤷‍♀️. Can you get yourself a companion so that you can upload videos even faster and the other would also help in validation?

[@vladislavzubov2818]

You are awesome. Thanks for your work man.

[@fazilabano1309]

Thank u so much i am waiting for this vedio😊

[@SimpleSnippets]

Most welcome 😊

[@vijaykumarsanugonda2784]

Nice sir, keep going on....

[@SimpleSnippets]

Thank you, I will. Please do share the videos and channel with your friends too. Thats the biggest help and support you can give back to our channel!

[@kirtientertainments3119]

Bro you missed to consider node 44 at 42:20

[@sarvottampriyadarshee5425]

you don't need to check the balance factor of each node after a new insertion in AVL. We only need to check the new-node's ancestors (because those are the nodes whose balance factor may get disturbed by this insertion. Furthermore, we should take bottom up approach to calculate the balance factor, if any nodes bf is not {-1, 0, 1} we perform the rotations. And if we get to a node whose bf becomes zero after this new insertion, we can safely stop checking for imbalance above that node!

[@Zohaib6801]

HI. Are there any more videos coming up? Likely about implementation of AVL Tree and B Tree?

[@SimpleSnippets]

Yes, absolutely

[@nikotech8085]

@@SimpleSnippets you forgot 44 in last step

[@hinamitsuha7507]

should the last result be "self-balanced binary search tree"? I mean after 99 gets added to the tree, where the 44 is inside too... so you don't have to do rotating... my calculation where the last number (99) gets inserted is a balance one... anyway, thank you for your efforts. It helps me a lot!

[@hnssb7533]

yeah. He didn't write 44

[@ishanrai3951]

yess he forgot 44

[@ashishgupta7849]

node (44) is deleted?

[@MKSundaram]

Great work! keep it up. Stay blessed :-)

[@rejinapv2472]

Excellent

[@MuzammalHussain-l7x]

it will be good if we have just like doubly linked list as each node has one more pointer which is for parent

[@duck730]

Thank you my hero

[@shivakumary7839]

Broo you forgot to add 44 (42:21) But it's OK I got the concept

[@everettcienkus2989]

I think you forgot to add the 44 back into the new AVL Tree at 42:21

[@SimpleSnippets]

Oh yes, an honest mistake. Sorry for that and good you pointed it out. Means you were focussing well 🤪 I'll add a comment to pin

[@everettcienkus2989]

@@SimpleSnippets No worries

[@Zohaib6801]

@@SimpleSnippets If there was 44 already, was the tree balanced at that very moment? I mean after inserting 99?

[@hinamitsuha7507]

@@Zohaib6801yes, mine was balanced tree...

[@souravmalani6813]

Why can't my professor teach that much good.

[@shubhamsandanshiv515]

Sir can u make vedio on threaded binary tree plz

[@rohansharma4395]

Skipped 44 mid-solution and that modified the answer

[@SumantXD]

plz start a series on DP

[@SimpleSnippets]

Soon!

[@rahulkumarsingh7615]

Bro, i think there is a mistake in value 44:

[@shivakumary7839]

yes

[@ruchitraushan2895]

ALERT ALERT ALERT🚩🚩🚩🚩 43:59 timetag... Actually you left the 44 which creates the unbalance in the structure..... So if you are reading my comment then please improve it as it has very different answer.....

[@mahmoudsaleem2988]

i think the whole idea is : when we want to balance a bst in the insertion operation we check the balance of the tree then we start with the non balanced node and then we compare the value we inserted with it then compare with the child of the non balanced node to determine the type of the rotation with a 3 successor nodes as the descendants then three nodes we start the operation of the rotation am i right ?? thanks in advance 😍😍😍😍

[@hil449]

i dont think we need to check the balance factor of the whole tree, only the balance factor of the nodes in the path from the root up to the node to be inserted

[@muzammalhussain4887]

love from pakistan❣❣

[@tabishmadni6284]

Sir, are you planning to add graph in DSA playlist also?

[@SimpleSnippets]

Yes ofcourse I will

[@athirapj4726]

HI..IN THIS EXAMPLE NUMBER 44 IS MISSING..PLS CHECK..YOU ARE EXPLAINED CLEARLY THANK YOU

[@ashishkadam4279]

sir can you please create videos on graph topic

[@SimpleSnippets]

Yes I will

[@samafianasar3749]

Aoa sir 44 wali node khan giii i think mistakenly likhaa ni gyaaa

[@SimpleSnippets]

Yes that was a silly mistake

[@sagarkumar138]

44 ko gayab kar diya sir ne 😂😂

[@fazilabano1309]

Plz upload the vedio on avl tree insertion with coding plz

[@SimpleSnippets]

Soon

[@anshusharma1444]

where is 44??

[@shaurya2063]

Where did 44 went in the last step I think you missed it sir

[@ranjan4112]

In final calculation, you have skipped 44 please look into that...

[@kalpakpatil5489]

42:21 You forgot 44.

[@sparadkar3640]

I forget to add 44 after 88 balancing bro

[@ibrahemnjr9924]

nice one 🤍

[@M_Abdullah_Azeem]

U missed 44.

[@dibeiwang8654]

you accidently deleted 44 after inserting 88

[@rajaneeshkumar4518]

Excellent