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 a height of a tree?

848

Which is faster binary or linear search?

855

Differentiate between list and set.

1026

What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?

1003

Reverse a linked list from the middle.

897

Is linked list faster than array?

812

Is binary tree balanced?

798

What is difference between linear and non linear data structure?

1110

What are two types of sorting?

973

Tell me do array subscripts always start with zero?

852

What is difference between tree and forest?

856

Does treeset remove duplicates?

886

Can sets contain duplicates?

793

What is the need for path compression?

1039

Is boolean a data type?

912