What are the disadvantages of representing a stack or queue by a linked list?
- 1 Answers
- 1019 Views
- I also Faced
- E-Mail Answers
Answer / Chandra Mohan
1. Inefficient access time: Since elements in a linked list are accessed by traversing through the pointers, accessing an element at an arbitrary position can be slow compared to arrays.
2. Insertion and deletion operations are slower due to the need to update pointer references.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is radix sort stable?
Which sorting is used in collections sort?
Why is reflection slower?
Explain the term recursive case?
Why is hashset used?
What are the tasks performed during preorder traversal?
You want to insert a new item in a binary search tree. How would you do it?
Is array part of collection framework?
What is the purpose of thread?
Mention a few applications of linked lists?
List the applications of stacks?
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
Windows 
