Answer:
The time complexity in the computer science is define as the computational complexity which basically describe the total amount of the time taken to execute the algorithm.
Time complexity is basically estimated by count the number of operation perform by the algorithm.
The time complexity of add-element operation is 2*log n or O(log n) and each time complexity is done by the log n times.