Interested to Buy Any Domain ? << Click Here >> for more details...
In which data structure, elements can be added or removed at
either end, but not in the middle?
- 42 Answers
- 106035 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / megha jain
Link list is not the right ans as insertion and deletion
can also b in the middle..... ans is Deck(Double Ended
Queue)
| Is This Answer Correct ? | 23 Yes | 2 No |
Answer / sumit
dequeue is the correct answer.unlike queues elements can be
added at both ends rather than one end ,but not in the middle..
| Is This Answer Correct ? | 22 Yes | 4 No |
Answer / ujjwal dave
Stack and Queue are also not correct because in stack
elements can be added and deleted only from one end.
In queue addition takes place at one end and deletion from
other.....
we want to add elements at both ends.....so deques is the
only correct answer
| Is This Answer Correct ? | 17 Yes | 3 No |
Answer / poornakala
linked list is not right. its two way stack. double ended
queue can also cannot be as u need to have 4 pointers for
them... but two way stack needs 2 pointers and can only be
deleted and inserted at the end.
| Is This Answer Correct ? | 17 Yes | 8 No |
Answer / vaishali naidu
Double ended queue is the right answer but stack and queue
are also right answers as they allow LIFO and FIFO
principles not deletion or inserting from middle. IF its a
priority queue then we can insert the elements in between.
| Is This Answer Correct ? | 7 Yes | 3 No |
Answer / sandeep
i think link list is wrong answer and deque is the correct ans
thanks
| Is This Answer Correct ? | 4 Yes | 1 No |
Answer / loveleen kaur
a deque is a linear list in which elements can be added or
removed at either end but not in the middle..it is the
contraction of name double ended queue..
| Is This Answer Correct ? | 3 Yes | 1 No |
Answer / gopesh
IT is stack...because we can push or pop at one end.......it can be done using array where one side is fixed or using linked list where either head is kept constant or null node.....
| Is This Answer Correct ? | 2 Yes | 2 No |
Write an algorithm for inserting and deleting an element from doubly linked list?
What is a treemap used for?
Which is more efficient merge sort vs quicksort?
Define right-in threaded tree?
Define root?
Can array store heterogeneous data?
How do you find the second largest element in an array of integers?
Is quicksort greedy algorithm?
What will be the output of below code?
What are linked list?
What is the use of prototype?
How do signed and unsigned numbers affect memory?
Windows 
