COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Linked lists are ____
|
|
static
|
|
|
dynamic
|
|
|
both
|
|
|
none of above
|
Explanation:
Detailed explanation-1: -LinkedList is a dynamic structure, means the list can grow or shrink depending upon the data making it more powerful and flexible than Arrays. Unlike Arrays, LinkedList is not stored in a contiguous memory location. Each element int the list is spread across the memory and are linked by the pointers in the Node.
Detailed explanation-2: -A linked list is a dynamic data structure. The number of nodes in a list is not fixed and can grow and shrink on demand.
Detailed explanation-3: -Linked lists are the best and simplest example of a dynamic data structure that uses pointers for its implementation.
Detailed explanation-4: -The linked list is dynamic in size whereas the array is static.
There is 1 question to complete.