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
- 105931 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / tasneem uddin
Double Ended Queue is the right answer.
| Is This Answer Correct ? | 25 Yes | 0 No |
Post New Answer View All Answers
What is a static structure?
What is an ordered list?
How many types of linked lists are there?
What does bubble sort do?
What are the different types of data type?
What is a data structure? What are the types of data structures? Briefly explain them
List the limitations of linear probing?
Which sorting has less time complexity?
How do you create a tree diagram?
Define a priority queue?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
Is hashmap ordered?
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
Write a recursive c function to calculate the height of a binary tree.
Why is hashset not ordered?
