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

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



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

What is map entry?

495


List some applications of multilinked structures?

515


Tell me can the size of operator be used to tell the size of an array passed to a function?

515


What is a singletonlist?

490


How many types of data structures are there?

527






Can we store a string and integer together in an array?

466


Define dynamic data structures?

548


Difference between calloc and malloc ?

529


What is difference between hashmap and arraylist?

514


What is a map programming?

482


What is a pass in bubble sort?

490


What is a treemap chart?

449


Why do we use collections?

477


Is red black tree balanced?

505


What is data structure and its types?

488