DSA · Theory

Why is deleting in a Singly Linked List O(1)

Theory

249/810

Why is deleting in a Singly Linked List O(1)

Sara only reaches for Why is deleting in a Singly Linked List O(1) (delete sll o1) when a ticket queue node has to stay correct in a counter.

Why is deleting in a Singly Linked List O(1) (delete sll o1) order: meaning → head → next → … → one limit. Dumping ten features helps nobody.

Why is deleting in a Singly Linked List O(1) (delete sll o1) exists so Sara can keep a ticket queue node correct in a counter.

Why is deleting in a Singly Linked List O(1) (delete sll o1) shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Why is deleting in a Singly Linked List O(1) (delete sll o1) trap: losing the next pointer on delete. Sara loses marks for that every viva.

Place Why is deleting in a Singly Linked List O(1) (delete sll o1) next to nearby DSA work — head → next → … is the link.

Close Why is deleting in a Singly Linked List O(1) (delete sll o1) with: “If I skip it, a ticket queue node goes wrong like this: losing the next pointer on delete.”

Diagram

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

Exam tip

Say Why is deleting in a Singly Linked List O(1) (delete sll o1) 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

Why is deleting in a Singly Linked List O(1) (delete sll o1) — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefWhy is deleting in a Singly Linked List O(1) (delete sll o1) — Sara uses it for a ticket queue node in a counter.
RuleWhy is deleting in a Singly Linked List O(1) (delete sll o1) → head → next → ….
RememberWhy is deleting in a Singly Linked List O(1) (delete sll o1) + a dry-run table (a counter).
UseWhy is deleting in a Singly Linked List O(1) (delete sll o1) in a counter (a ticket queue node).
TrapWhy is deleting in a Singly Linked List O(1) (delete sll o1) — losing the next pointer on delete.
ExWhy is deleting in a Singly Linked List O(1) (delete sll o1) → 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

Why is deleting in a Singly Linked List O(1)

Example

Short notes

Questions

Why is deleting in a Singly Linked List O(1)

Example

Short notes

Questions