Dequeue is the exactly Right answer........am 100% sure for it.........

In which data structure, elements can be added or removed at
either end, but not in the middle?

Question Posted / naz

Answer Posted / naz

Dequeue is the exactly Right answer........am 100% sure for
it.........

Is This Answer Correct ?

22 Yes

0 No

Please Help Members By Posting Answers For Below Questions

What is perfect binary tree?

795

What is data structure geeksforgeeks?

1198

What are the properties of binary tree?

871

How to sort an Array?

867

Explain implementation of traversal of a binary tree.

989

What are the major data structures used in the hierarchical data model?

961

What is a matrix? Explain its uses with an example

1065

Why do we need linked list?

781

Model a data structure for a DFA that takes an event as parameter and performs a desired action.

1051

Explain multiply linked list in short.

874

What is ordered map?

800

Why is hashmap faster than treemap?

853

What is the difference between Strings and Arrays?

965

What is height balanced tree?

878

A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.

978