Summary - Linked list

Build three nodes and print their values in a mini task.

Summary - Linked list

In this group you learned what a linked list is, node definition, traversal and insertion. Access and search are O(n), head insertion is O(1).

Linked lists offer flexible size and fast head insertion but require linear access. Arrays offer O(1) access.

Exercise Append to list

Write list_append(head, data). Add a new node at the end, return head. Print 7 with print(list_append(None, 7)['data']).

Show example solution

def list_append(head, data):
    # Append
    new_node = {'data': data, 'next': None}
    if head is None:
        return new_node
    node = head
    while node['next'] is not None:
        node = node['next']
    node['next'] = new_node
    return head
print(list_append(None, 7)['data'])

Test yourself

Summary - Linked list: match the terms

Node

data + next
head

First node
Head insert

O(1)
Traversal

O(n)

Linked list

Each node in a linked list contains a ____ pointer.

Show answer

Each node in a linked list contains a next pointer.

What is the advantage of a linked list?
- O(1) access
- Fixed size
- Flexible size, O(1) head insert
- O(log n) search
Show answer

Flexible size, O(1) head insert — Flexible size and O(1) head insert.

Next lesson: What is a stack?

We Are Enhancing Your Experience

Cookie Preferences

Strictly Necessary Cookies

Analytical Cookies