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
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

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

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

Related questions

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories

Other Questions

“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Seven basic internal components found in a computer tower
Link Copied!