Create a Circular Singly Linked List in DSA Java - Interactive Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to create a node class for the circular singly linked list.

DSA Java

class Node {
    int data;
    Node next;

    Node(int data) {
        this.data = data;
        this.[1] = null;
    }
}

Drag options to blanks, or click blank then click option'

Aprev

Bnext

Chead

Dtail

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'prev' which is for doubly linked lists.

Using 'head' or 'tail' inside the node class.

The 'next' pointer in a node points to the next node in the list. Initializing it to null is standard.

2fill in blank

medium

Complete the code to initialize the circular singly linked list with a single node pointing to itself.

DSA Java

public class CircularSinglyLinkedList {
    Node head;

    public CircularSinglyLinkedList(int data) {
        head = new Node(data);
        head.[1] = head;
    }
}

Drag options to blanks, or click blank then click option'

Anext

Bhead

Cprev

Dtail

Attempts:

3 left

💡 Hint

Common Mistakes

Setting next to null instead of pointing to itself.

Using wrong pointer names like 'prev'.

In a circular singly linked list with one node, the node's next points to itself.

3fill in blank

hard

Fix the error in the add method to correctly insert a new node at the end of the circular singly linked list.

DSA Java

public void add(int data) {
    Node newNode = new Node(data);
    if (head == null) {
        head = newNode;
        newNode.next = newNode;
    } else {
        Node temp = head;
        while (temp.[1] != head) {
            temp = temp.next;
        }
        temp.next = newNode;
        newNode.next = head;
    }
}

Drag options to blanks, or click blank then click option'

Anext

Btail

Chead

Dprev

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'prev' which does not exist in singly linked list.

Using 'head' as a pointer inside the loop condition.

To find the last node, we traverse using the 'next' pointer until we reach the head again.

4fill in blank

hard

Fill both blanks to complete the method that prints all elements in the circular singly linked list.

DSA Java

public void printList() {
    if (head == null) {
        System.out.println("List is empty");
        return;
    }
    Node temp = head;
    do {
        System.out.print(temp.[1] + " -> ");
        temp = temp.[2];
    } while (temp != head);
    System.out.println("null");
}

Drag options to blanks, or click blank then click option'

Adata

Bnext

Cprev

Dhead

Attempts:

3 left

💡 Hint

Common Mistakes

Trying to print 'next' instead of 'data'.

Using 'prev' which does not exist.

To print the data, access 'data'. To move forward, use 'next'.

5fill in blank

hard

Fill all three blanks to complete the method that deletes the node with given data from the circular singly linked list.

DSA Java

public void delete(int key) {
    if (head == null) return;

    Node current = head, prev = null;
    do {
        if (current.[1] == key) {
            if (prev != null) {
                prev.[2] = current.[3];
            } else {
                // Deleting head node
                Node temp = head;
                while (temp.next != head) {
                    temp = temp.next;
                }
                if (head.next == head) {
                    head = null;
                } else {
                    temp.next = head.next;
                    head = head.next;
                }
            }
            return;
        }
        prev = current;
        current = current.next;
    } while (current != head);
}

Drag options to blanks, or click blank then click option'

Adata

Bnext

Cprev

Dhead

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'prev' instead of 'next' for pointers.

Not handling deletion of the head node correctly.

We compare 'data' to key, update 'prev.next' to 'current.next' to remove the node.

Practice

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

easy

A. In a circular singly linked list, nodes have two pointers instead of one.

B. In a circular singly linked list, nodes are stored in an array.

C. In a circular singly linked list, the last node points back to the first node.

D. In a circular singly linked list, the first node points to null.

Solution

1. Step 1: Understand the structure of a regular singly linked list

   A regular singly linked list has nodes where each node points to the next node, and the last node points to null.

2. Step 2: Understand the structure of a circular singly linked list

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

3. Final Answer:

   In a circular singly linked list, the last node points back to the first node. -> Option C

4. Quick Check:

   Last node points to first node = B [OK]

Hint: Remember: circular means last node links back to start [OK]

Common Mistakes:

• Thinking circular means nodes have two pointers
• Confusing circular list with doubly linked list
• Assuming last node points to null

2. Which of the following is the correct way to create a new node in Java for a circular singly linked list?

easy

A. Node newNode = new Node(); newNode.next = newNode;

B. Node newNode = new Node(data); newNode.next = null;

C. Node newNode = new Node(); newNode.data = data; newNode.next = null;

D. Node newNode = new Node(data); newNode.next = newNode;

Solution

1. Step 1: Understand node creation for circular singly linked list

   When creating a single node in a circular singly linked list, its next pointer should point to itself to form a circle.

2. Step 2: Check each option

   Node newNode = new Node(data); newNode.next = newNode; sets newNode.next = newNode, which correctly points the node to itself. Other options set next to null or do not initialize properly.

3. Final Answer:

   Node newNode = new Node(data); newNode.next = newNode; -> Option D

4. Quick Check:

   Node points to itself when alone = A [OK]

Hint: Single node's next points to itself in circular list [OK]

Common Mistakes:

• Setting next to null for single node
• Not initializing next pointer
• Confusing syntax for node creation

3. What will be the output of the following code snippet that creates a circular singly linked list with two nodes and prints their data?

class Node {
  int data;
  Node next;
  Node(int d) { data = d; next = null; }
}

public class Test {
  public static void main(String[] args) {
    Node head = new Node(10);
    Node second = new Node(20);
    head.next = second;
    second.next = head;

    System.out.print(head.data + " -> " + head.next.data + " -> " + head.next.next.data);
  }
}

medium

A. 10 -> 20 -> 10

B. 10 -> 20 -> null

C. 10 -> 20 -> 20

D. Compilation error

Solution

1. Step 1: Trace the node connections

   head.data = 10, head.next = second (data 20), second.next = head (data 10), forming a circle.

2. Step 2: Evaluate the print statement

   head.data = 10, head.next.data = 20, head.next.next.data = second.next.data = head.data = 10.

3. Final Answer:

   10 -> 20 -> 10 -> Option A

4. Quick Check:

   Circle repeats first node data = 10 -> 20 -> 10 [OK]

Hint: Follow next pointers carefully to see the cycle [OK]

Common Mistakes:

• Assuming next.next is null
• Confusing node data values
• Expecting compilation error

4. Identify the error in the following code that tries to insert a new node at the end of a circular singly linked list:

public void insertEnd(Node head, int data) {
  Node newNode = new Node(data);
  if (head == null) {
    head = newNode;
    newNode.next = head;
  } else {
    Node temp = head;
    while (temp.next != null) {
      temp = temp.next;
    }
    temp.next = newNode;
    newNode.next = head;
  }
}

medium

A. The while loop condition should check for temp.next != head instead of null.

B. The newNode.next should be set to null instead of head.

C. The head should be updated to newNode after insertion.

D. The method should return the new head node.

Solution

1. Step 1: Understand circular list traversal

   In a circular singly linked list, the last node's next points to head, not null.

2. Step 2: Analyze the while loop condition

   The loop checks temp.next != null, which never happens in circular list; it should check temp.next != head to find the last node.

3. Final Answer:

   The while loop condition should check for temp.next != head instead of null. -> Option A

4. Quick Check:

   Loop must stop at last node pointing to head = A [OK]

Hint: In circular list, last node points to head, not null [OK]

Common Mistakes:

• Using null to detect end in circular list
• Not updating newNode.next correctly
• Ignoring head update when list is empty

5. You want to create a circular singly linked list from an array of integers {5, 10, 15} by inserting nodes at the end. Which sequence of next pointers correctly represents the final circular list?

hard

A. 15 -> 10 -> 5 -> 15

B. 5 -> 10 -> 15 -> 5

C. 5 -> 10 -> 15 -> null

D. 5 -> 15 -> 10 -> 5

Solution

1. Step 1: Insert nodes at end in given order

   Insert 5 first, then 10 at end, then 15 at end, preserving order: 5, 10, 15.

2. Step 2: Set last node's next to head

   After insertion, last node (15) points back to head (5), making the list circular.

3. Final Answer:

   5 -> 10 -> 15 -> 5 -> Option B

4. Quick Check:

   Order preserved, last points to first = C [OK]

Hint: Insert at end keeps order; last node points to first [OK]

Common Mistakes:

• Assuming last node points to null
• Reversing insertion order
• Mixing node data order