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

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.
Please help me ! All you do is just put it it all in your own words ! Please this is for my reported card!i don't know how to put it in my own words because my English is not that good!
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Disadvantages of using animation in advertising? advantages and disadvantages of using animation for education? advantages and disadvantages of using animation in entertainment?
Link Copied!