DSA · Theory

Applications, Advantages and Disadvantages of Linked List

Theory

659/810

Applications, Advantages and Disadvantages of Linked List

Applications, Advantages and Disadvantages of Linked List sits in a counter. Farhan’s job is a ticket queue node. Write that first.

Applications, Advantages and Disadvantages of Linked List on the board: head → next → …. Then say what a ticket queue node looks like after.

Applications, Advantages and Disadvantages of Linked List exists so Farhan can keep a ticket queue node correct in a counter.

Applications, Advantages and Disadvantages of Linked List shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Don’t do this with Applications, Advantages and Disadvantages of Linked List: losing the next pointer on delete. Interviewers spot it in ten seconds.

After Applications, Advantages and Disadvantages of Linked List, Farhan should still remember losing the next pointer on delete.

Viva for Applications, Advantages and Disadvantages of Linked List: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

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

Exam tip

Board: a ticket queue node. Dry-run Applications, Advantages and Disadvantages of Linked List. Name the trap: 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

Applications, Advantages and Disadvantages of Linked List — a linked list chains nodes with next pointers instead of contiguous indexes.

Short notes

DefApplications, Advantages and Disadvantages of Linked List — Farhan uses it for a ticket queue node in a counter.
RuleApplications, Advantages and Disadvantages of Linked List → head → next → ….
RememberApplications, Advantages and Disadvantages of Linked List + time vs memory (a counter).
UseApplications, Advantages and Disadvantages of Linked List in a counter (a ticket queue node).
TrapApplications, Advantages and Disadvantages of Linked List — losing the next pointer on delete.
ExApplications, Advantages and Disadvantages of 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

Applications, Advantages and Disadvantages of Linked List

Example

Short notes

Questions

Applications, Advantages and Disadvantages of Linked List

Example

Short notes

Questions