Circular vs Linear Linked List Key Difference in DSA Typescript - Why the Distinction Matters

The Big Idea

What if your list could magically loop forever without losing track?

The Scenario

Imagine you have a list of friends to call one by one. If you write their names on paper in a line, you have to start over from the top every time you finish. It's easy to lose track or forget where you left off.

The Problem

Using a simple list means you must remember where you stopped. If you lose your place, you start again from the beginning. This wastes time and can cause mistakes, especially if the list is long or you want to keep calling friends in a loop.

The Solution

Circular linked lists connect the last friend back to the first, making a circle. This way, you can keep moving forward without stopping or losing your place. It's like a round table where everyone gets a turn continuously.

Before vs After

✗ Before

class Node {
  data: number;
  next: Node | null;
  constructor(data: number) {
    this.data = data;
    this.next = null;
  }
}
// Last node points to null
lastNode.next = null;

✓ After

class Node {
  data: number;
  next: Node;
  constructor(data: number) {
    this.data = data;
    this.next = this; // points to itself initially
  }
}
// Last node points back to head
lastNode.next = head;

What It Enables

It enables continuous cycling through elements without restarting or losing track, perfect for tasks needing repeated rounds.

Real Life Example

Think of a music playlist that repeats songs endlessly. A circular linked list lets the player move from the last song back to the first smoothly, without stopping.

Key Takeaways

Linear lists end with a null pointer; circular lists loop back to the start.

Circular lists help when you want to cycle through items repeatedly.

Linear lists are simpler but need manual restart to loop.

Practice

1. What is the main difference between a circular linked list and a linear linked list?

easy

A. In a circular linked list, the last node points back to the first node, forming a circle.

B. In a linear linked list, the last node points back to the first node, forming a circle.

C. A circular linked list has no nodes.

D. A linear linked list always has only one node.

Solution

1. Step 1: Understand node connections in linear linked list

   In a linear linked list, nodes are connected one after another, and the last node points to null, ending the list.

2. Step 2: Understand node connections in circular linked list

   In a circular linked list, the last node points back to the first node, creating a loop or circle.

3. Final Answer:

   In a circular linked list, the last node points back to the first node, forming a circle. -> Option A

4. Quick Check:

   Circular list loops back = In a circular linked list, the last node points back to the first node, forming a circle. [OK]

Hint: Circular loops back to start; linear ends with null [OK]

Common Mistakes:

• Confusing which list loops back
• Thinking linear list forms a circle
• Assuming circular list has no end node

2. Which of the following is the correct way to check if a single-node linked list is circular in TypeScript?

easy

A. if (head.next === 0) { /* linear list */ }

B. if (head.next === null) { /* linear list */ }

C. if (head.next === undefined) { /* circular list */ }

D. if (head.next === head) { /* circular list */ }

Solution

1. Step 1: Understand node pointer in circular list

   In a circular linked list, the next pointer of the last node points back to the head node itself.

2. Step 2: Check the condition for circular list

   If head.next equals head, it means the list loops back to the start, confirming circularity.

3. Final Answer:

   if (head.next === head) { /* circular list */ } -> Option D

4. Quick Check:

   Next points to head means circular [OK]

Hint: Check if next points to head for circular list [OK]

Common Mistakes:

• Checking for null instead of head
• Using undefined instead of null
• Confusing zero with null pointer

3. Consider this TypeScript code for a circular linked list:

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

const head = new Node(1);
const second = new Node(2);
const third = new Node(3);

head.next = second;
second.next = third;
third.next = head;

let current = head;
let count = 0;
while (count < 5) {
  console.log(current.value);
  current = current.next!;
  count++;
}

What will be the output printed?

medium

A. 1 2 3 null null

B. 1 2 3 1 2

C. 1 2 3 4 5

D. 1 2 3 3 3

Solution

1. Step 1: Understand the circular linked list structure

   The last node (third) points back to head, so the list loops: 1 -> 2 -> 3 -> 1 -> ...

2. Step 2: Trace the loop for 5 iterations

   Starting at head (1), the values printed are: 1, 2, 3, then loops back to 1, then 2.

3. Final Answer:

   1 2 3 1 2 -> Option B

4. Quick Check:

   Circular list repeats nodes in order [OK]

Hint: Circular list repeats nodes; count controls output length [OK]

Common Mistakes:

• Assuming list ends after 3 nodes
• Printing null after last node
• Confusing node values after loop

4. The following TypeScript code attempts to detect if a linked list is circular but has a bug:

function isCircular(head: Node | null): boolean {
  let current = head;
  while (current !== null) {
    if (current.next === head) {
      return true;
    }
    current = current.next!;
  }
  return false;
}

What is the bug in this code?

medium

A. It incorrectly returns true for linear lists.

B. It does not handle empty lists (head = null).

C. It may enter an infinite loop if the list is circular but not pointing directly to head.

D. It uses 'current.next!' which causes a syntax error.

Solution

1. Step 1: Analyze the loop condition and pointer movement

   The loop moves current to current.next until current is null or current.next equals head.

2. Step 2: Identify the problem with circular lists

   If the list is circular but the loop does not point directly back to head (e.g., cycle in middle), the loop never ends, causing infinite loop.

3. Final Answer:

   It may enter an infinite loop if the list is circular but not pointing directly to head. -> Option C

4. Quick Check:

   Loop may never end if cycle not at head [OK]

Hint: Check for cycles anywhere, not just pointing to head [OK]

Common Mistakes:

• Assuming only last node points to head
• Ignoring infinite loop possibility
• Confusing syntax error with logic error

5. You want to convert a linear linked list into a circular linked list in TypeScript. Given the code below, which line correctly completes the conversion?

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

const head = new Node(10);
const second = new Node(20);
const third = new Node(30);

head.next = second;
second.next = third;
third.next = null; // currently linear list

// Which line below makes the list circular?
// A: third.next = null;
// B: second.next = head;
// C: head.next = third;
// D: third.next = head;

medium

A. third.next = head;

B. second.next = head;

C. head.next = third;

D. third.next = null;

Solution

1. Step 1: Understand the current list structure

   The list is linear: head -> second -> third -> null.

2. Step 2: Make the last node point to head to form a circle

   Setting third.next = head connects the last node back to the first, making the list circular.

3. Final Answer:

   third.next = head; -> Option A

4. Quick Check:

   Last node points to head for circular list [OK]

Hint: Last node's next must point to head for circular list [OK]

Common Mistakes:

• Setting next to null keeps list linear
• Pointing head.next to third breaks order
• Pointing second.next to head creates wrong cycle