multiple choice data structures
suppose that you have the following algorithm to sort a list ofinteger numbers.
Algorithm:
1. thre first step is to build an avl-tree with the input list ofinteger numbers.
2. the second step is to incorporate in- order traversal of theavl-tree. thots recursive algorithm allows to print the value ofthe nodes of the avl-tree in sorted order.
what is the total running time complexity of this algorithm?
A. O(log N)
B. O(N)
C. O(NlogN)
D. O(N^2)
Answer
C. O(NlogN)