What are the advantages of linked list over an array?
- 1 Answers
- 1048 Views
- I also Faced
- E-Mail Answers
Answer / Dheeraj Pal Singh
Linked lists and arrays are both important data structures with their own unique benefits. Here are some advantages of linked lists compared to arrays:
1. Dynamic Size: Unlike arrays, linked lists can grow or shrink dynamically during runtime as elements are added or removed.
2. Memory Efficiency: Linked lists use memory more efficiently for large lists because they don't need to store empty elements when the list size changes.
3. No Contiguous Memory Needed: Linked lists do not require contiguous blocks of memory, which can be an advantage in some systems with fragmented memory.
4. Insertion and Deletion Operations: Linked lists allow for efficient insertion and deletion operations at arbitrary positions without affecting the rest of the list.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can arraylist contain duplicates?
Which sort is stable?
What is the difference between array and stack in data structures?
Define structure property in a heap?
Is set sorted?
What do you mean by articulation point?
List all data structures you would use for a memory management module.
1 Answers HPCL, Hughes Systique Corporation, ITC Indian Tobacco Company,
What is difference between hashmap and linkedhashmap?
Can we put null key in hashmap?
Can treeset contain duplicates?
How to create your own data structure in java?
Is treeset synchronized?
Windows 
