COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Easy to modify
|
|
|
Easy to understand
|
|
|
Easy to see
|
|
|
All of the above
|
Detailed explanation-1: -It’s really simple to insert and remove the nodes. We don’t have to move elements after they are added or removed, which is unlike what happens in Arrays. In the linked list, we only have to update the address at the next point of nodes.
Detailed explanation-2: -The advantages of linked lists include: Overflow can never occur unless the memory is actually full. Insertions and deletions are easier than for contiguous (array) lists. With large records, moving pointers is easier and faster than moving the items themselves.
Detailed explanation-3: -Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities.