Check if a linked list is Circular Linked List

Given a singly linked list, find if the linked list is circular or not. A linked list is called circular if it not NULL terminated and all nodes are connected in the form of a cycle. Below is an example of circular linked list.

An empty linked list is considered as circular.

Note that this problem is different from cycle detection problem, here all nodes have to be part of cycle.



The idea is to store head of the linked list and traverse it. If we reach NULL, linked list is not circular. If reach head again, linked list is circular.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to check if linked list is circular
#include<bits/stdc++.h>
using namespace std;
  
/* Link list Node */
struct Node
{
    int data;
    struct Node* next;
};
  
/* This function returns true if given linked
   list is circular, else false. */
bool isCircular(struct Node *head)
{
    // An empty linked list is circular
    if (head == NULL)
       return true;
  
    // Next of head
    struct Node *node = head->next;
  
    // This loop would stope in both cases (1) If
    // Circular (2) Not circular
    while (node != NULL && node != head)
       node = node->next;
  
    // If loop stopped because of circular
    // condition
    return (node == head);
}
  
// Utility function to create a new node.
Node *newNode(int data)
{
    struct Node *temp = new Node;
    temp->data = data;
    temp->next = NULL;
    return temp;
}
  
/* Drier program to test above function*/
int main()
{
    /* Start with the empty list */
    struct Node* head = newNode(1);
    head->next = newNode(2);
    head->next->next = newNode(3);
    head->next->next->next = newNode(4);
  
    isCircular(head)? cout << "Yes\n" :
                      cout << "No\n" ;
  
    // Making linked list circular
    head->next->next->next->next = head;
  
    isCircular(head)? cout << "Yes\n" :
                      cout << "No\n" ;
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to check if 
// linked list is circular
import java.util.*;
  
class GFG
{
      
/* Link list Node */
static class Node
{
    int data;
    Node next;
}
  
/*This function returns true if given linked
list is circular, else false. */
static boolean isCircular( Node head)
{
    // An empty linked list is circular
    if (head == null)
    return true;
  
    // Next of head
    Node node = head.next;
  
    // This loop would stope in both cases (1) If
    // Circular (2) Not circular
    while (node != null && node != head)
    node = node.next;
  
    // If loop stopped because of circular
    // condition
    return (node == head);
}
  
// Utility function to create a new node.
static Node newNode(int data)
{
    Node temp = new Node();
    temp.data = data;
    temp.next = null;
    return temp;
}
  
/* Driver code*/
public static void main(String args[])
{
    /* Start with the empty list */
    Node head = newNode(1);
    head.next = newNode(2);
    head.next.next = newNode(3);
    head.next.next.next = newNode(4);
  
    System.out.print(isCircular(head)? "Yes\n" :
                    "No\n" );
  
    // Making linked list circular
    head.next.next.next.next = head;
  
    System.out.print(isCircular(head)? "Yes\n" :
                    "No\n" );
  
}
}
  
// This code contributed by Arnab Kundu

chevron_right


C#

// C# program to check if
// linked list is circular
using System;
public class GFG
{

/* Link list Node */
public class Node
{
public int data;
public Node next;
}

/*This function returns true if given linked
list is circular, else false. */
static bool isCircular( Node head)
{
// An empty linked list is circular
if (head == null)
return true;

// Next of head
Node node = head.next;

// This loop would stope in both cases (1) If
// Circular (2) Not circular
while (node != null && node != head)
node = node.next;

// If loop stopped because of circular
// condition
return (node == head);
}

// Utility function to create a new node.
static Node newNode(int data)
{
Node temp = new Node();
temp.data = data;
temp.next = null;
return temp;
}

/* Driver code*/
public static void Main(String []args)
{
/* Start with the empty list */
Node head = newNode(1);
head.next = newNode(2);
head.next.next = newNode(3);
head.next.next.next = newNode(4);

Console.Write(isCircular(head)? “Yes\n” :
“No\n” );

// Making linked list circular
head.next.next.next.next = head;

Console.Write(isCircular(head)? “Yes\n” :
“No\n” );

}
}
// This code has been contributed by 29AjayKumar


Output :

No
Yes

This article is contributed by Shivam Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above



My Personal Notes arrow_drop_up

Improved By : andrew1234, 29AjayKumar