DSA · Theory

Union and Intersection of two Linked Lists

Theory

219/810

Union and Intersection of two Linked Lists

Don’t start Union and Intersection of two Linked Lists with jargon. Start with a ticket queue node. That is the whole point.

Union and Intersection of two Linked Lists on the board: head → next → …. Then say what a ticket queue node looks like after.

Union and Intersection of two Linked Lists exists so Riya can keep a ticket queue node correct in a counter.

Union and Intersection of two Linked Lists shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Union and Intersection of two Linked Lists trap: losing the next pointer on delete. Riya loses marks for that every viva.

Union and Intersection of two Linked Lists is not a lonely heading. Riya ties it to a ticket queue node.

One breath for Union and Intersection of two Linked Lists, then a ticket queue node, then losing the next pointer on delete. Sit down.

Diagram

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

Exam tip

Board: a ticket queue node. Dry-run Union and Intersection of two Linked Lists. Name the trap: losing the next pointer on delete.

Example

# Union and Intersection of two Linked Lists
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Union and Intersection of two Linked Lists: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefUnion and Intersection of two Linked Lists — Riya uses it for a ticket queue node in a counter.
RuleUnion and Intersection of two Linked Lists → head → next → ….
RememberUnion and Intersection of two Linked Lists + a dry-run table (a counter).
UseUnion and Intersection of two Linked Lists in a counter (a ticket queue node).
TrapUnion and Intersection of two Linked Lists — losing the next pointer on delete.
ExUnion and Intersection of two Linked Lists → a ticket queue node.

DSA · Theory

Union and Intersection of two Linked Lists

← All stacks

Theory

219/810

Union and Intersection of two Linked Lists

Don’t start Union and Intersection of two Linked Lists with jargon. Start with a ticket queue node. That is the whole point.

Union and Intersection of two Linked Lists on the board: head → next → …. Then say what a ticket queue node looks like after.

Union and Intersection of two Linked Lists exists so Riya can keep a ticket queue node correct in a counter.

Union and Intersection of two Linked Lists shows up in a counter. Name a ticket queue node, not “a real-world scenario”.

Union and Intersection of two Linked Lists trap: losing the next pointer on delete. Riya loses marks for that every viva.

Union and Intersection of two Linked Lists is not a lonely heading. Riya ties it to a ticket queue node.

One breath for Union and Intersection of two Linked Lists, then a ticket queue node, then losing the next pointer on delete. Sit down.

Diagram

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

Exam tip

Board: a ticket queue node. Dry-run Union and Intersection of two Linked Lists. Name the trap: losing the next pointer on delete.

Example

# Union and Intersection of two Linked Lists
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Union and Intersection of two Linked Lists: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefUnion and Intersection of two Linked Lists — Riya uses it for a ticket queue node in a counter.
RuleUnion and Intersection of two Linked Lists → head → next → ….
RememberUnion and Intersection of two Linked Lists + a dry-run table (a counter).
UseUnion and Intersection of two Linked Lists in a counter (a ticket queue node).
TrapUnion and Intersection of two Linked Lists — losing the next pointer on delete.
ExUnion and Intersection of two Linked Lists → a ticket queue node.

Union and Intersection of two Linked Lists

Example

Short notes

Questions

Union and Intersection of two Linked Lists

Example

Short notes

Questions