Memory Layout Comparison Array vs Linked List in DSA C++ - Trade-offs & Analysis

Mental Model

Arrays store items next to each other in memory, while linked lists store items scattered with pointers connecting them.

Analogy: Imagine a row of mailboxes side by side (array) versus houses spread out in a neighborhood connected by roads (linked list).

Array: [1][2][3][4][5]
Linked List: 1 -> 2 -> 3 -> 4 -> 5 -> null

Dry Run Walkthrough

Input: Compare memory layout of array and linked list with elements 1, 2, 3

Goal: Understand how elements are stored and connected in memory for arrays and linked lists

Step 1: Visualize array elements stored contiguously

[1][2][3]

Why: Array elements are placed side by side in one block of memory

Step 2: Visualize linked list nodes scattered with pointers

1 -> 2 -> 3 -> null

Why: Each linked list node can be anywhere in memory, connected by pointers

Step 3: Show how accessing element 2 differs

Array: direct access [2]
Linked List: follow pointer from 1 to 2

Why: Array allows direct access by index, linked list requires traversal

Result:

Array memory: [1][2][3]
Linked List memory: 1 -> 2 -> 3 -> null
Access difference: array direct, linked list pointer traversal

Annotated Code

DSA C++

#include <iostream>
#include <vector>

struct Node {
    int data;
    Node* next;
    Node(int val) : data(val), next(nullptr) {}
};

void printArray(const std::vector<int>& arr) {
    std::cout << "Array: ";
    for (int val : arr) {
        std::cout << val << " ";
    }
    std::cout << "\n";
}

void printLinkedList(Node* head) {
    std::cout << "Linked List: ";
    Node* curr = head;
    while (curr != nullptr) {
        std::cout << curr->data << " -> ";
        curr = curr->next; // advance to next node
    }
    std::cout << "null\n";
}

int main() {
    // Array with elements 1, 2, 3
    std::vector<int> arr = {1, 2, 3};

    // Linked list with elements 1 -> 2 -> 3 -> null
    Node* head = new Node(1);
    head->next = new Node(2);
    head->next->next = new Node(3);

    printArray(arr);
    printLinkedList(head);

    // Clean up linked list memory
    Node* curr = head;
    while (curr != nullptr) {
        Node* temp = curr;
        curr = curr->next;
        delete temp;
    }

    return 0;
}

curr = curr->next; // advance to next node

advance pointer to next node to traverse linked list

Output

Array: 1 2 3 

Linked List: 1 -> 2 -> 3 -> null

Complexity Analysis

Time: O(n) to traverse both array and linked list because we visit each element once

Space: O(n) for both because they store n elements; linked list uses extra space for pointers

vs Alternative: Array uses contiguous memory for fast direct access; linked list uses scattered memory with pointers, making access slower but insertion/deletion easier

Edge Cases

empty array and empty linked list

Both print nothing or null; no elements to show

DSA C++

while (curr != nullptr) {

single element array and linked list

Prints one element; linked list next pointer is null

DSA C++

head->next = nullptr;

When to Use This Pattern

When you see a problem asking about memory use or access speed differences between data structures, think about array vs linked list memory layout to choose the right one.

Common Mistakes

Mistake: Assuming linked list elements are stored next to each other in memory
Fix: Remember linked list nodes can be anywhere in memory and are connected by pointers

Mistake: Thinking array access requires traversal like linked list
Fix: Array allows direct access by index without traversal

Summary

Shows how arrays store elements contiguously and linked lists store elements scattered with pointers.

Use arrays when you need fast direct access and linked lists when you need easy insertion/deletion.

The key insight is arrays use continuous memory blocks, linked lists use nodes connected by pointers.

Practice

1. Which of the following best describes the memory layout of an array compared to a linked list?

easy

A. Both array and linked list nodes are scattered randomly in memory.

B. Array elements are scattered in memory, while linked list nodes are stored contiguously.

C. Both array and linked list nodes are stored contiguously in memory.

D. Array elements are stored in contiguous memory locations, while linked list nodes are scattered in memory.

Solution

1. Step 1: Understand array memory layout

   Arrays store elements in contiguous memory blocks, meaning elements are placed one after another in memory.

2. Step 2: Understand linked list memory layout

   Linked list nodes are allocated dynamically and can be anywhere in memory, connected by pointers.

3. Final Answer:

   Array elements are stored in contiguous memory locations, while linked list nodes are scattered in memory. -> Option D

4. Quick Check:

   Array = contiguous, Linked List = scattered [OK]

Hint: Arrays are contiguous; linked lists use pointers to scattered nodes [OK]

Common Mistakes:

• Thinking linked list nodes are contiguous
• Confusing array with linked list memory layout
• Assuming both have same memory layout

2. Which C++ declaration correctly defines a linked list node struct with an integer data and a pointer to the next node?

easy

A. struct Node { int data; Node* next; };

B. struct Node { int data; Node next; };

C. struct Node { int data; Node& next; };

D. struct Node { int data; int* next; };

Solution

1. Step 1: Understand pointer usage in struct

   The next node pointer must be a pointer type to allow linking nodes dynamically.

2. Step 2: Analyze each option

   struct Node { int data; Node next; }; uses Node next (not pointer), invalid. struct Node { int data; Node* next; }; uses Node* next (correct pointer). struct Node { int data; Node& next; }; uses reference Node& next (not suitable for linked list). struct Node { int data; int* next; }; uses int* next (wrong type).

3. Final Answer:

   struct Node { int data; Node* next; }; -> Option A

4. Quick Check:

   Pointer to next node = Node* next [OK]

Hint: Use Node* for next pointer in linked list node struct [OK]

Common Mistakes:

• Using object instead of pointer for next
• Using reference instead of pointer
• Using wrong pointer type

3. Consider the following C++ code snippet that creates an array and a linked list with 3 elements each. What is the output of the memory addresses printed for the array and linked list nodes?

int arr[3] = {10, 20, 30};
struct Node { int data; Node* next; };
Node* n1 = new Node{10, nullptr};
Node* n2 = new Node{20, nullptr};
Node* n3 = new Node{30, nullptr};
n1->next = n2; n2->next = n3;

std::cout << &arr[0] << " " << &arr[1] << " " << &arr[2] << std::endl;
std::cout << n1 << " " << n2 << " " << n3 << std::endl;

medium

A. Both array and linked list addresses are contiguous

B. Array addresses are contiguous; linked list addresses are non-contiguous

C. Array addresses are non-contiguous; linked list addresses are contiguous

D. Both array and linked list addresses are non-contiguous

Solution

1. Step 1: Analyze array memory addresses

   Array elements are stored contiguously, so &arr[0], &arr[1], &arr[2] will be adjacent addresses.

2. Step 2: Analyze linked list node addresses

   The nodes are separately allocated dynamically with new; their addresses (printed as n1, n2, n3) are non-contiguous in memory.

3. Final Answer:

   Array addresses are contiguous; linked list addresses are non-contiguous -> Option B

4. Quick Check:

   Array contiguous, linked list scattered [OK]

Hint: Array addresses are adjacent; linked list nodes scattered [OK]

Common Mistakes:

• Assuming linked list nodes are contiguous
• Confusing variable addresses with pointer values
• Ignoring dynamic allocation behavior

4. The following code attempts to create a linked list of 3 nodes but has a bug related to memory layout. Identify the bug.

struct Node {
  int data;
  Node* next;
};

Node* head = new Node{1, nullptr};
Node* second = new Node{2, nullptr};
Node* third = new Node{3, nullptr};

head->next = second;
second = third;
third->next = nullptr;

medium

A. The line 'second = third;' breaks the link between first and second nodes.

B. The nodes are not allocated dynamically.

C. The next pointers are not set correctly for all nodes.

D. The head pointer is not initialized.

Solution

1. Step 1: Trace pointer assignments

   head->next = second links first node to second node correctly. Then 'second = third;' changes the local second pointer to point to third node, but node2->next remains nullptr. third->next = nullptr sets nothing new.

2. Step 2: Understand impact on linked list

   The next pointer of the second node is never set to the third node, so the list is 1 -> 2 -> null with third node unreachable from head.

3. Final Answer:

   The next pointers are not set correctly for all nodes. -> Option C

4. Quick Check:

   Missing second->next = third [OK]

Hint: Changing pointer variable breaks links; update next pointers instead [OK]

Common Mistakes:

• Confusing pointer variable with node's next pointer
• Ignoring pointer reassignment effect
• Assuming nodes are not dynamically allocated

5. You want to store 1 million integers and frequently access elements by index. Considering memory layout and access speed, which data structure is better and why?

1. Array
2. Linked List

hard

A. Array, because contiguous memory allows fast index access and better cache performance.

B. Linked List, because scattered nodes reduce memory fragmentation and improve access speed.

C. Linked List, because dynamic allocation uses less memory than arrays.

D. Array, because linked lists require extra memory for pointers making them slower.

Solution

1. Step 1: Consider access by index

   Arrays allow direct access by index in O(1) time due to contiguous memory layout.

2. Step 2: Consider memory and cache effects

   Contiguous memory improves cache locality, speeding up access. Linked lists have scattered nodes, causing cache misses and slower access.

3. Final Answer:

   Array, because contiguous memory allows fast index access and better cache performance. -> Option A

4. Quick Check:

   Fast index access = Array with contiguous memory [OK]

Hint: For fast index access, choose arrays due to contiguous memory [OK]

Common Mistakes:

• Assuming linked list is faster for index access
• Ignoring cache locality effects
• Confusing memory fragmentation with access speed