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
- 105873 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Is quicksort greedy algorithm?
Are duplicates allowed in hashmap?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
What are the disadvantages of linked list over array?
How does dynamic memory allocation help in managing data?
How many links are there in a binary tree of N nodes?
What is the complexity of sorting algorithm?
What is scalar example?
What are the tasks performed while traversing a binary tree?
What are the difference between malloc() and calloc()?
What is binary search tree and explain its time complexity?
Define a linear data structure.
Can a tree be empty?
Is selection sort greedy?
What is an ordered map?
