S7-P1,2,3

Question 1

F this, Good notes

177

Answer 1

A
Note: Thus the overall time complexity of inserting a node in an AVL Tree is O(logn), so creating an AVL tree of n nodes is of O(nlogn).

Question 2

F this

178

Answer 2

A

Question 3

F this

179

Answer 3

A

Question 4

F this

180

Answer 4

A

Question 5

181

Answer 5

A

Question 6

F this

182

Answer 6

A

Question 7

End Of P1,2,3