Circular vs Linear Linked List Key Difference in DSA Javascript - Build Both Approaches

Understanding Circular vs Linear Linked List Key Difference

📖 Scenario: Imagine you have a group of friends sitting in a circle playing a game. Each friend holds hands with the next friend, and the last friend holds hands with the first friend, forming a circle. This is like a circular linked list. Now imagine the same friends sitting in a straight line, where the last friend does not hold hands with anyone. This is like a linear linked list.

🎯 Goal: You will create two linked lists in JavaScript: one linear and one circular. You will see how the last node connects differently in each list. This will help you understand the key difference between circular and linear linked lists.

📋 What You'll Learn

Create a linear linked list with nodes containing values 1, 2, and 3

Create a circular linked list with nodes containing values 4, 5, and 6

Set a variable to identify the last node in each list

Print the values of the last node's next pointer for both lists

💡 Why This Matters

🌍 Real World

Linked lists are used in music playlists, image viewers, and task scheduling where items are connected in order. Circular linked lists help in repeating cycles like round-robin scheduling.

💼 Career

Understanding linked lists is fundamental for software developers, especially in roles involving system design, memory management, and algorithm optimization.

1

Create a linear linked list with nodes 1, 2, and 3

Create three node objects called node1, node2, and node3 with values 1, 2, and 3 respectively. Link them linearly by setting node1.next = node2 and node2.next = node3. Set node3.next to null to mark the end of the list.

DSA Javascript

// Create node1, node2, node3 with values 1, 2, 3
// Link nodes linearly
// Set node3.next to null

Hint

Remember to create each node as an object with value and next properties. Link them by assigning the next property.

2

Create a circular linked list with nodes 4, 5, and 6

Create three node objects called node4, node5, and node6 with values 4, 5, and 6 respectively. Link them circularly by setting node4.next = node5, node5.next = node6, and node6.next = node4 to form a circle.

DSA Javascript

const node1 = { value: 1, next: null };
const node2 = { value: 2, next: null };
const node3 = { value: 3, next: null };
node1.next = node2;
node2.next = node3;
node3.next = null;
// Create node4, node5, node6 with values 4, 5, 6
// Link nodes circularly

Hint

Link the last node's next back to the first node to create a circle.

3

Set variables to identify the last node in each list

Create two variables called lastLinearNode and lastCircularNode. Set lastLinearNode to node3 (the last node of the linear list) and lastCircularNode to node6 (the last node of the circular list).

DSA Javascript

const node1 = { value: 1, next: null };
const node2 = { value: 2, next: null };
const node3 = { value: 3, next: null };
node1.next = node2;
node2.next = node3;
node3.next = null;

const node4 = { value: 4, next: null };
const node5 = { value: 5, next: null };
const node6 = { value: 6, next: null };
node4.next = node5;
node5.next = node6;
node6.next = node4;
// Set lastLinearNode to node3
// Set lastCircularNode to node6

Hint

Assign the variables directly to the nodes representing the last elements in each list.

4

Print the next values of the last nodes in both lists

Print the value of lastLinearNode.next and the value of lastCircularNode.next. Use console.log to print lastLinearNode.next and lastCircularNode.next.value.

DSA Javascript

const node1 = { value: 1, next: null };
const node2 = { value: 2, next: null };
const node3 = { value: 3, next: null };
node1.next = node2;
node2.next = node3;
node3.next = null;

const node4 = { value: 4, next: null };
const node5 = { value: 5, next: null };
const node6 = { value: 6, next: null };
node4.next = node5;
node5.next = node6;
node6.next = node4;

const lastLinearNode = node3;
const lastCircularNode = node6;
// Print lastLinearNode.next
// Print lastCircularNode.next.value

Hint

The linear list's last node points to null. The circular list's last node points back to the first node, which has value 4.

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