Circular Linked List
Don’t start Circular Linked List (cll) with jargon. Start with a ticket queue node. That is the whole point.
Circular Linked List (cll) on the board — head → next → …. Then say what a ticket queue node looks like after.
Circular Linked List (cll) exists so Vikram can keep a ticket queue node correct in a counter.
Circular Linked List (cll) shows up in a counter. Name a ticket queue node, not “a real-world scenario”.
If a ticket queue node breaks under Circular Linked List (cll), check losing the next pointer on delete first.
After Circular Linked List (cll), Vikram should still remember losing the next pointer on delete.
One breath for Circular Linked List (cll), then a ticket queue node, then losing the next pointer on delete. Sit down.
[10] → [20] → [30] → / head tail
Board: a ticket queue node. Dry-run Circular Linked List (cll). Name the trap: losing the next pointer on delete.