DSA · Theory

Delete all occurrences of a given key in a linked list

Theory

533/810

Delete all occurrences of a given key in a linked list

Don’t start Delete all occurrences of a given key in a linked list with jargon. Start with a ticket queue node. That is the whole point.

Delete all occurrences of a given key in a linked list on the board: head → next → …. Then say what a ticket queue node looks like after.

Without Delete all occurrences of a given key in a linked list, a counter gets messy and a ticket queue node is hard to trust.

Delete all occurrences of a given key in a linked list shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Don’t do this with Delete all occurrences of a given key in a linked list: losing the next pointer on delete. Interviewers spot it in ten seconds.

Delete all occurrences of a given key in a linked list is not a lonely heading. Dev ties it to a ticket queue node.

Viva for Delete all occurrences of a given key in a linked list: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

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

Exam tip

Say Delete all occurrences of a given key in a 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

Delete all occurrences of a given key in a linked list — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefDelete all occurrences of a given key in a linked list — Dev uses it for a ticket queue node in a counter.
RuleDelete all occurrences of a given key in a linked list → head → next → ….
RememberDelete all occurrences of a given key in a linked list + a dry-run table (a counter).
UseDelete all occurrences of a given key in a linked list in a counter (a ticket queue node).
TrapDelete all occurrences of a given key in a linked list — losing the next pointer on delete.
ExDelete all occurrences of a given key in a 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

Delete all occurrences of a given key in a linked list

Example

Short notes

Questions

Delete all occurrences of a given key in a linked list

Example

Short notes

Questions