Trees
closed

• closed by
443 views
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.7k
1.7k views
Ujjaval251 asked Mar 14, 2023
1,718 views
S1 : An insertion in an AVL with n nodes requires O(n) rotations.answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n).tell me if i ...
1 1 vote
0 0 answers
787
787 views
Chaitanya Kale asked Oct 9, 2022
787 views
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
0 0 votes
0 0 answers
502
502 views