[Solved] What is the time complexity of the code that uses self-balancing BST for determining the number of inversions in an array?

What is the time complexity of the code that uses self-balancing BST for determining the number of inversions in an array?

a) O(n2)
b) O(n)
c) O(log n)
d) O(n log n)

Answer: d
Explanation: When a self-balancing BST like an AVL tree is used to calculate the number of inversions in an array then the time complexity is O(n log n) as AVL insert takes O(log n) time.

Comments