Practice
Learn
← Quit
0 / 0 correct
Data Structures
Medium
1 of 20
Why can a stack be implemented with a dynamic array efficiently?
A
Arrays never resize
B
Stacks need random access
C
Arrays support O(1) insert at the front
D
Push and pop happen at the end, which is amortized O(1)