it must b DEQUEUE,where elements can be added or removed at either end,bu

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

Question Posted / achintya shankar adhikari

Answer Posted / achintya shankar adhikari

it must b DEQUEUE,where elements can be added or removed at
either end,but not from the middle end..

Is This Answer Correct ?

25 Yes

3 No

Please Help Members By Posting Answers For Below Questions

How do you declare An array of three char pointers

1028

What is a map in programming?

898

Define left-in threaded tree?

870

How do arrays work?

946

Which sorting method is slowest?

971

What is stack explain with diagram?

910

What are linked lists most commonly used for?

897

What is difference between array and string?

1003

Find duplicates in infinite range. Which data structure to be used to give efficient solution?

964

Is stack a dynamic data structure?

902

What is dangling pointer and how to avoid it?

975

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.

1037

What is meant by heap sort?

870

How to create your own data structure in java?

931

Define outdegree of a graph?

967