Question 17082 – NTA UGC NET JUNE-2023 Paper-2
November 5, 2023Question 881 – Nielit Scentist-B [02-12-2018]
November 5, 2023Question 10361 – Data-Structures
What is the worst case time complexity of inserting n2 elements into an AVL-tree with n elements initially?
Correct Answer: D
Question 6 Explanation:
AVL Tree all operations(insert, delete and search) will take O(logn) time.
In question they asked about n2 elements.
So, In worst case it will take o(n2 log n) time.
In question they asked about n2 elements.
So, In worst case it will take o(n2 log n) time.
θ(n4)
θ(n2)
θ(n3)
θ(n2 log n)
Subscribe
Login
0 Comments