Mention the advantages of representing stacks using linked lists than arrays?
- 1 Answers
- 989 Views
- I also Faced
- E-Mail Answers
Answer / Amit Rawat
Representing a stack using a linked list has advantages over an array, such as: (1) No need to worry about the size of the array, as it can grow dynamically. (2) Insertion and deletion operations are faster because no reallocation of memory is required.
| Is This Answer Correct ? | 0 Yes | 0 No |
Differentiate between the singly linked list and doubly linked list.
What is a graph?
Is hashmap sorted?
How do you get placements?
Tell me how to find middle element of linked list in one pass?
What is difference between capacity and size of arraylist?
What is heap tree explain with example?
What is the difference between collections class vs collections interface?
How do you use the sort function?
What does it mean to sort an array?
Explain how is linked list implemented?
What is dynamic array how it is created?
Windows 
