DSA · Theory

Unrolled Linked List

← All stacks

Theory

185/810

Unrolled Linked List

Unrolled Linked List is a DSA idea you prove with a ticket queue node, not with a slogan.

Keep Unrolled Linked List small. Vikram should finish a ticket queue node in a few lines, not a 40-line dump.

Unrolled Linked List exists so Vikram can keep a ticket queue node correct in a counter.

Unrolled Linked List shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Unrolled Linked List miss — losing the next pointer on delete. Fix it before you talk about advanced DSA.

After Unrolled Linked List, Vikram should still remember losing the next pointer on delete.

One breath for Unrolled Linked List, then a ticket queue node, then losing the next pointer on delete. Sit down.

Diagram

  [10] → [20] → [30] → /
   head              tail

Exam tip

Say Unrolled Linked List in one breath, then head → next → …, then losing the next pointer on delete.

Example

class Node:
    def __init__(self, val, next=None):
        self.val = val
        self.next = next

head = Node(1, Node(2, Node(3)))
cur = head
while cur:
    print(cur.val, end=" -> " if cur.next else "\n")
    cur = cur.next

Unrolled Linked List — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefUnrolled Linked List — Vikram uses it for a ticket queue node in a counter.
RuleUnrolled Linked List → head → next → ….
RememberUnrolled Linked List + time vs memory (a counter).
UseUnrolled Linked List in a counter (a ticket queue node).
TrapUnrolled Linked List — losing the next pointer on delete.
ExUnrolled Linked List → a ticket queue node.

class Node: def __init__(self, val, next=None): self.val = val self.next = next head = Node(1, Node(2, Node(3))) cur = head while cur: print(cur.val, end=" -> " if cur.next else "\n") cur = cur.next

Unrolled Linked List

Example

Short notes

Questions

Unrolled Linked List

Example

Short notes

Questions