Which of the following data structures can erase from its beginning or its end in O(1) time? O(1) Pick ONE option vector deque stack segment tree

deque<br /><br />Explanation: A deque (double-ended queue) is a data structure that allows insertion and deletion of elements from both ends in O(1) time. Therefore, it can erase elements from its beginning or end in O(1) time.