Circular vs Linear Linked List Key Difference in DSA Javascript - Visual Comparison

Concept Flow - Circular vs Linear Linked List Key Difference

Start with head node

↓

Traverse nodes one by one

↓

Check next pointer

↓

End traversal

Traverse nodes from head, linear list ends when next is null, circular list ends when next points back to head.

Execution Sample

DSA Javascript

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

Defines a node with a value and a next pointer initialized to null.

Execution Table

Step	Operation	Nodes in List	Pointer Changes	Visual State
1	Create node A	A	head -> A	A -> null (Linear), A -> A (Circular)
2	Create node B	A -> B	A.next -> B	A -> B -> null (Linear), A -> B -> A (Circular)
3	Create node C	A -> B -> C	B.next -> C	A -> B -> C -> null (Linear), A -> B -> C -> A (Circular)
4	Linear list traversal	A -> B -> C	Traverse until C.next == null	A -> B -> C -> null
5	Circular list traversal	A -> B -> C	Traverse until current.next == head	A -> B -> C -> A
6	End traversal	N/A	Stop condition met	Traversal ends

💡 Traversal stops when next is null (linear) or next points to head (circular)

Variable Tracker

Variable	Start	After Step 1	After Step 2	After Step 3	After Step 4/5	Final
head	null	A	A	A	A	A
A.next	null	null	B	B	B	B
B.next	null	null	null	C	C	C
C.next	null	null	null	null	null (Linear) / A (Circular)	null (Linear) / A (Circular)
current	null	A	B	C	null (Linear) / A (Circular)	null

Key Moments - 3 Insights

Why does traversal in a circular linked list stop when current.next points to head?

Because in a circular linked list, the last node's next points back to the head, so reaching head again means we completed a full circle (see execution_table step 5).

Why does traversal in a linear linked list stop when current.next is null?

Because null indicates the end of the list, no more nodes to visit (see execution_table step 4).

What happens if we try to traverse a circular linked list like a linear one?

Traversal will never end because next is never null; it loops back to head, causing an infinite loop (see variable_tracker C.next after step 5).

Visual Quiz - 3 Questions

Look at the execution_table at step 3, what is the pointer state of B.next?

A B.next points to C

B B.next is null

C B.next points to A

D B.next points to head

💡 Hint

Check the 'Pointer Changes' column at step 3 in execution_table

At which step does the linear linked list traversal stop?

A Step 5

B Step 4

C Step 6

D Step 3

💡 Hint

Look at the 'Operation' and 'Visual State' columns for linear list traversal in execution_table

If C.next in the circular list was set to null instead of head, what would happen during traversal?

A Traversal would loop infinitely

B Traversal would stop at B

C Traversal would stop at C like linear list

D Traversal would skip node C

💡 Hint

Refer to variable_tracker for C.next values and traversal stop conditions

Concept Snapshot

Circular vs Linear Linked List Key Difference:
- Linear list ends when last node's next is null.
- Circular list ends when last node's next points back to head.
- Traversal stops accordingly to avoid infinite loops.
- Pointer changes define list type.
- Important to check next pointer during traversal.

Full Transcript

This visual execution compares circular and linear linked lists. Both start with nodes connected by next pointers. In a linear list, the last node's next is null, marking the end. In a circular list, the last node's next points back to the head, forming a loop. Traversal stops when next is null for linear, or when next points to head for circular. Variables like head, current, and next pointers change as nodes are created and linked. Key moments include understanding traversal stop conditions and avoiding infinite loops in circular lists. The execution table shows step-by-step node creation and traversal states, helping learners see how pointers define list behavior.

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; in a linear linked list, the last node points to null.

B. In a linear linked list, nodes form a circle; in a circular linked list, nodes end with null.

C. Circular linked lists store data in a circle shape; linear linked lists store data in a straight line.

D. Circular linked lists use arrays internally; linear linked lists use pointers.

Solution

1. Step 1: Understand the pointer of the last node in linear linked list

   In a linear linked list, the last node's next pointer is null, indicating the end of the list.

2. Step 2: Understand the pointer of the last node in circular linked list

   In a circular linked list, the last node's next pointer points back to the first node, forming a circle.

3. Final Answer:

   In a circular linked list, the last node points back to the first node; in a linear linked list, the last node points to null. -> Option A

4. Quick Check:

   Last node pointer difference = In a circular linked list, the last node points back to the first node; in a linear linked list, the last node points to null. [OK]

Hint: Last node points null in linear, loops to head in circular [OK]

Common Mistakes:

• Confusing the direction of pointers in circular vs linear
• Thinking circular lists end with null
• Assuming circular lists use arrays internally

2. Which of the following is the correct way to check if a linked list is circular in JavaScript?

easy

A. if (head.next === head) { /* circular list */ } else if (head.next === null) { /* linear list */ }

B. if (head === null) { /* empty list */ } else if (head.next === head) { /* circular list */ }

C. if (head.next === null) { /* linear list */ } else { /* circular list */ }

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

Solution

1. Step 1: Check the next pointer of head node

   If head.next points to head itself, it means the list is circular with one node.

2. Step 2: Check if next pointer is null for linear list

   If head.next is null, it means the list ends there, so it is linear.

3. Final Answer:

   if (head.next === head) { /* circular list */ } else if (head.next === null) { /* linear list */ } -> Option A

4. Quick Check:

   Check next pointer for circular or null for linear [OK]

Hint: Check if next points to head for circular, null for linear [OK]

Common Mistakes:

• Checking undefined instead of null
• Assuming head.next null means circular
• Not handling empty list (head null) case

3. Consider the following JavaScript code for a circular linked list with three nodes. What will be the output when traversing and printing the list once starting from head?

class Node {
  constructor(data) {
    this.data = data;
    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; // circular link

let current = head;
let output = '';
do {
  output += current.data + ' -> ';
  current = current.next;
} while (current !== head);
output += 'null';
console.log(output);

medium

A. Infinite loop, no output

B. 1 -> 2 -> 3 -> 1 -> 2 -> 3 -> null

C. 1 -> 2 -> 3 -> 1 -> null

D. 1 -> 2 -> 3 -> null

Solution

1. Step 1: Understand the circular linked list structure

   The last node points back to the head, creating a loop: 1 -> 2 -> 3 -> 1 ...

2. Step 2: Trace the traversal loop once

   The do-while loop prints nodes starting at head and stops when it reaches head again after one full cycle, printing "1 -> 2 -> 3 -> null".

3. Final Answer:

   1 -> 2 -> 3 -> null -> Option D

4. Quick Check:

   Traverse once until back to head = 1 -> 2 -> 3 -> null [OK]

Hint: Traverse until current equals head again to print once [OK]

Common Mistakes:

• Thinking loop prints infinitely
• Appending extra nodes after stopping
• Confusing do-while with while loop

4. The following code attempts to detect if a linked list is circular. What is the bug?

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

medium

A. It does not handle empty list (head null) case.

B. It incorrectly returns true for linear lists.

C. It may cause infinite loop if list has a cycle not pointing to head.

D. It uses strict equality instead of loose equality.

Solution

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

   The loop moves through nodes until current is null, checking if current.next equals head.

2. Step 2: Identify the problem with cycles not pointing to head

   If the list has a cycle that does not point back to head, the loop never reaches null and never finds current.next === head, causing an infinite loop.

3. Final Answer:

   It may cause infinite loop if list has a cycle not pointing to head. -> Option C

4. Quick Check:

   Cycle detection fails if cycle not at head [OK]

Hint: Cycle may not point to head, causing infinite loop [OK]

Common Mistakes:

• Assuming all cycles point to head
• Not checking for null head before loop
• Confusing strict and loose equality

5. You have a linked list where the last node points back to the third node (not the head). Which type of linked list is this, and what is the key difference from a linear linked list?

hard

A. It is a linear linked list; the key difference is the last node points to the third node.

B. It is a circular linked list; the key difference is the last node points to a node inside the list, not null.

C. It is a doubly linked list; the key difference is nodes have two pointers.

D. It is a circular linked list; the key difference is the last node points to the head only.

Solution

1. Step 1: Identify the type of linked list by last node pointer

   The last node points back to the third node, creating a loop inside the list, which defines a circular linked list.

2. Step 2: Compare with linear linked list ending

   In a linear linked list, the last node points to null, marking the end. Here, the last node points inside the list, so it is circular.

3. Final Answer:

   It is a circular linked list; the key difference is the last node points to a node inside the list, not null. -> Option B

4. Quick Check:

   Last node points inside list = circular list [OK]

Hint: Last node points inside list means circular, not linear [OK]

Common Mistakes:

• Thinking only head pointer defines circular list
• Confusing doubly linked list with circular list
• Assuming last node must point to head for circular