Register

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

Which of the following data structures can erase from its beginning or its end in 0(1) time? Pick ONE option -) vector -) deque -) stack -) segment tree
asked 137k views
2 votes
Which of the following data structures can erase from its beginning or its end in 0(1) time? Pick ONE option

-) vector
-) deque
-) stack
-) segment tree

asked
User Volvox
by
8.2k points

1 Answer

3 votes

Answer:

A Circular Queue is the data structure that can erase from its beginning or its end in O(1) time

answered
User Andy Lorenz
by
7.4k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to Qamnty — a place to ask, share, and grow together. Join our community and get real answers from real people.

Categories

Other Questions

“What does it mean when we “rework” copyrighted material?”
Seven basic internal components found in a computer tower
Disadvantages of using animation in advertising? advantages and disadvantages of using animation for education? advantages and disadvantages of using animation in entertainment?
Link Copied!