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?
Sir ur classses are so so soooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppoperb and i am requesting u to put about polynomial addition
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....
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
exactly,, he should mention
Same doubt
Yeah, same problem.
16:05 error sir
The correct order is 👇
A
\
C
\
B
U made my day sir..thanks for uploading videos
Thank u for ur informative and clear explanation sir..
Hello sir,
The RL rotation which u hv thought is wrong just check it once...
Exactly
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?
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
Yes bro there is mistake
Hi!! Sir
Could you please give clarity on LR and RL .since the order is changed
Very helpful....
Sir ur classses are so so soooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppoperb and i am requesting u to put about polynomial addition
Good of DSA for me .
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....
Digital image processing la smoothing pathi oru vedio podunka sir
in RL Rotation step 1 which is the correct tree sir can you give answer in reply
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
Very usefull for me
Height is calculated wrongly i think?
On RL B was supposed to be Positive 1 right?
Hello Sir,
It is more useful if u explain the same in eclipse after practical session..
Thanks,
Muniraj D
sir u did not upload AVL tree deletion?
Sir at which node you are rotating in left left and right right rotation
In this example BST is not applied sir....
Good job sir
Sir!! Suppose if we have unbalanced nodes at 2 r more nodes then how to find out ??
why we need AVL tree?
To Search the node faster comparing to bst .
sir rotation so confuse sir........., plz say some easy way to understand
take values instead of A,B,C then it will be more clear
d Ajay I agree with you
Sir there is mistake at rl
Tree is already in balanced means .can we do rotation Bro?
Hi
If the tree is already balanced then no need to do rotations
I totally confused wt this sir????
Iam not clear yet
Delete a node from avl tree chapara
you have done RL rotation wrong