Q.

What is the time complexity of inserting at the end in dynamic arrays?

A. O(1)
B. O(n)
C. O(logn)
D. Either O(1) or O(n)
Answer» D. Either O(1) or O(n)
2k
0
Do you find this helpful?
17

View all MCQs in

Data Structures (DS)

Discussion

No comments yet

Related MCQs