A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
Asked in Mizoram PSC 3.Technical Paper-I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- A normal queue, if implemented using an array of size MAX_SIZE, gets full when
- What would be the asymptotic time complexity to insert an element at the second position in the linked list?
- Linked list is considered as an example of __________ type of memory allocation.
- You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?
- What is a memory efficient double linked list?
- Disadvantage of using array representation for binary trees is?
- In a binary search tree, which of the following traversals would print the numbers in the ascending order?
- What is a complete binary tree?