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
- 106979 Views
- Infosys, NIC, TTA, Wipro, I also Faced
- E-Mail Answers
Answer Posted / chandrashaker
the answers above said(linked lists,stacks,queues)are not correct answers.the correct answer is "dqueus" also called it as double ended queue in which we can insert all the elements from front and rear
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Two linked lists are given, find out the sum of them without altering the linked list?
What do you mean by garbage collection?
Which is faster hashmap or treemap?
What is the basic of data structure?
How can we reverse a singly linked list?
Does treemap allow null keys?
Explain the Stack
Differentiate between queue and stack.
Who created quicksort?
What do you mean by collision in hashing?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
What does stack top do?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What is pointer in data structure?
What is the difference between a Stack and a Queue.
