ROTATIONS IN AVL TREES - DATA STRUCTURES

[@vanib4483]

Hi sir
In RL rotation for step 1 result is A-C-B and step 2 is C-A-B C is the root node and A is left child , B is Right child

[@factcracked7939]

exactly,, he should mention

[@vangalkuduthal3325]

Same doubt

[@dipadutta8849]

Yeah, same problem.

[@catchmypoint6756]

16:05 error sir
The correct order is 👇
A
\
C
\
B

[@SriRam-np7sx]

U made my day sir..thanks for uploading videos

[@nagaranigovi7796]

Thank u for ur informative and clear explanation sir..

[@dajay67]

Sir,
In LR rotation when u did step 1 it result in A-C-B.
But in RL rotation when u did step 1 it resulted in A-B-C. I don't understand why this difference as u just turned left or right?

[@ankitsao7858]

this is because of property of binary search tree i.e lleft subtree is always less than the root and right subtree is always greater than root

[@jeevan4350]

Yes bro there is mistake

[@yeshwanthvaddipalli4548]

Hi!! Sir
Could you please give clarity on LR and RL .since the order is changed

[@dattasai3319]

Hello sir,
The RL rotation which u hv thought is wrong just check it once...

[@phanikumarsimhadri8124]

Exactly

[@DebdutBiswasOnline]

Very helpful....

[@arunkumarvenkatadass5001]

how can we implement these Rotations Through the Programming ...by means using any programming language ...can you upload video for my request for using "C" implement Rotations....

[@mojeshmeka9317]

sir in rl rotation while doing right rotation it (a-b-c == right rotation it becomes a-c-b but you told a-b-c ) which one is correct sir

[@akhil.creations]

in RL Rotation step 1 which is the correct tree sir can you give answer in reply

[@adithyakrishnan.r2266]

Sir ur classses are so so soooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppoperb and i am requesting u to put about polynomial addition

[@AmitSingh-ro2wr]

Good job sir

[@fruitlanguage678]

Digital image processing la smoothing pathi oru vedio podunka sir

[@skshapeer1881]

Good of DSA for me .

[@fruitlanguage678]

Very usefull for me

[@hemanthdaduva2870]

Sir at which node you are rotating in left left and right right rotation

[@sindhusiva4580]

Sir!! Suppose if we have unbalanced nodes at 2 r more nodes then how to find out ??

[@shaikrahaman4243]

sir u did not upload AVL tree deletion?

[@shashankkumar5487]

Height is calculated wrongly i think?

[@handwelljere]

On RL B was supposed to be Positive 1 right?

[@rohitchandure282]

d Ajay I agree with you

[@aksharam2111]

sir rotation so confuse sir........., plz say some easy way to understand

[@munirajd2917]

Hello Sir,
It is more useful if u explain the same in eclipse after practical session..
Thanks,
Muniraj D

[@narasimhamurthyboddepalli2849]

take values instead of A,B,C then it will be more clear

[@puttahemalatha2694]

In this example BST is not applied sir....

[@shubhamojha37]

Sir there is mistake at rl

[@fardilviews]

why we need AVL tree?

[@bharanidharan.m4245]

To Search the node faster comparing to bst .

[@vinothvk2711]

Tree is already in balanced means .can we do rotation Bro?

[@sundeepsaradhi]

Hi
If the tree is already balanced then no need to do rotations

[@CSEBshivani]

I totally confused wt this sir????

[@s.krishnabharaths.krishnabhara]

Iam not clear yet

[@sathvikachowdarykota5h88]

Delete a node from avl tree chapara

[@nakulchauhan6713]

you have done RL rotation wrong