DSA · Theory

Concatenation of two Linked Lists in O(1) time

Theory

282/810

Concatenation of two Linked Lists in O(1) time

Concatenation of two Linked Lists in O(1) time is simple if you keep it on paper. Sara uses it for a ticket queue node in a counter.

Do Concatenation of two Linked Lists in O(1) time once by hand. head → next → …. Change one input. Say the new result out loud.

Concatenation of two Linked Lists in O(1) time exists so Sara can keep a ticket queue node correct in a counter.

Use Concatenation of two Linked Lists in O(1) time when a ticket queue node must stay clear. If a simpler DSA step works, use that instead.

If a ticket queue node breaks under Concatenation of two Linked Lists in O(1) time, check losing the next pointer on delete first.

Place Concatenation of two Linked Lists in O(1) time next to nearby DSA work — head → next → … is the link.

Viva for Concatenation of two Linked Lists in O(1) time: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

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

Exam tip

For Concatenation of two Linked Lists in O(1) time: definition + a counter + one failure.

Example

# Concatenation of two Linked Lists in O(1) time
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)

Concatenation of two Linked Lists in O(1) time: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefConcatenation of two Linked Lists in O(1) time — Sara uses it for a ticket queue node in a counter.
RuleConcatenation of two Linked Lists in O(1) time → head → next → ….
RememberConcatenation of two Linked Lists in O(1) time + Big-O (a counter).
UseConcatenation of two Linked Lists in O(1) time in a counter (a ticket queue node).
TrapConcatenation of two Linked Lists in O(1) time — losing the next pointer on delete.
ExConcatenation of two Linked Lists in O(1) time → a ticket queue node.

DSA · Theory

Concatenation of two Linked Lists in O(1) time

← All stacks

Theory

282/810

Concatenation of two Linked Lists in O(1) time

Concatenation of two Linked Lists in O(1) time is simple if you keep it on paper. Sara uses it for a ticket queue node in a counter.

Do Concatenation of two Linked Lists in O(1) time once by hand. head → next → …. Change one input. Say the new result out loud.

Concatenation of two Linked Lists in O(1) time exists so Sara can keep a ticket queue node correct in a counter.

Use Concatenation of two Linked Lists in O(1) time when a ticket queue node must stay clear. If a simpler DSA step works, use that instead.

If a ticket queue node breaks under Concatenation of two Linked Lists in O(1) time, check losing the next pointer on delete first.

Place Concatenation of two Linked Lists in O(1) time next to nearby DSA work — head → next → … is the link.

Viva for Concatenation of two Linked Lists in O(1) time: what it is → head → next → … → the mistake (losing the next pointer on delete).

Diagram

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

Exam tip

For Concatenation of two Linked Lists in O(1) time: definition + a counter + one failure.

Example

# Concatenation of two Linked Lists in O(1) time
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)

Concatenation of two Linked Lists in O(1) time: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefConcatenation of two Linked Lists in O(1) time — Sara uses it for a ticket queue node in a counter.
RuleConcatenation of two Linked Lists in O(1) time → head → next → ….
RememberConcatenation of two Linked Lists in O(1) time + Big-O (a counter).
UseConcatenation of two Linked Lists in O(1) time in a counter (a ticket queue node).
TrapConcatenation of two Linked Lists in O(1) time — losing the next pointer on delete.
ExConcatenation of two Linked Lists in O(1) time → a ticket queue node.

Concatenation of two Linked Lists in O(1) time

Example

Short notes

Questions

Concatenation of two Linked Lists in O(1) time

Example

Short notes

Questions