DSA · Theory

RSS linked list

← All stacks

Theory

465/810

RSS linked list

Don’t start RSS linked list with jargon. Start with a ticket queue node. That is the whole point.

For RSS linked list, Big-O is in play. Don’t blame it until you have traced a ticket queue node.

Without RSS linked list, a counter gets messy and a ticket queue node is hard to trust.

Use RSS linked list when a ticket queue node must stay clear. If a simpler DSA step works, use that instead.

RSS linked list trap — losing the next pointer on delete. Rohit loses marks for that every viva.

Place RSS linked list next to nearby DSA work — head → next → … is the link.

One breath for RSS 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 RSS 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

RSS linked list — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefRSS linked list — Rohit uses it for a ticket queue node in a counter.
RuleRSS linked list → head → next → ….
RememberRSS linked list + Big-O (a counter).
UseRSS linked list in a counter (a ticket queue node).
TrapRSS linked list — losing the next pointer on delete.
ExRSS 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

RSS linked list

Example

Short notes

Questions

RSS linked list

Example

Short notes

Questions