A

Admin • 828.70K Points
Coach

Q. What is the time complexity of insertion at both ends in ArrayDeque?

  • (A) O(n)
  • (B) O(log n)
  • (C) O(1)
  • (D) O(n log n)
  • Correct Answer - Option(C)
  • Views: 13
  • Filed under category Java
  • Hashtags: Java Deque
Explanation by: Admin
ArrayDeque provides O(1) time complexity for insertions/removals at both ends.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.