Java - Search an element in the Circular Doubly Linked List

Searching an element in a circular doubly linked list requires creating a temp node pointing to the head of the list. Along with this, two more variables are required to track search and track index of the current node. If the temp node is not null at the start, then traverse th list to check if current node value matches with the search value. If it matches then update search tracker variable and stop traversing the list, else keep on traversing the list. If the temp node is empty at the start, then the list contains no item.

The function SearchElement is created for this purpose. It is a 4-step process.

void SearchElement(int searchValue) {
  
  //1. create a temp node pointing to head
  Node temp = new Node();
  temp = this.head;

  //2. create two variables: found - to track
  //   search, idx - to track current index
  int found = 0;
  int i = 0;

  //3. if the temp node is not null check the
  //   node value with searchValue, if found 
  //   update variables and break the loop, else
  //   continue searching till temp node is not head 
  if(temp != null) {
    while(true) {
      i++;
      if(temp.data == searchValue) {
        found++;
        break;
      }
      temp = temp.next;
      if(temp == this.head) {break;}
    }
    if (found == 1) {
      System.out.println(searchValue + " is found at index = " + i +".");
    } else {
      System.out.println(searchValue + " is not found in the list.");
    }
  } else {
    
    //4. If the temp node is null at the start, 
    //   the list is empty
    System.out.println("The list is empty.");
  }
}

The below is a complete program that uses above discussed concept to search an element in a given circular doubly linked list.

//node structure
class Node {
    int data;
    Node next;
    Node prev;
};

class LinkedList {
  Node head;

  LinkedList(){
    head = null;
  }

  //Add new element at the end of the list
  void push_back(int newElement) {
    Node newNode = new Node();
    newNode.data = newElement;
    newNode.next = null; 
    newNode.next = null;
    if(head == null) {
      head = newNode;
      newNode.next = head;
      newNode.prev = head;
    } else {
      Node temp = new Node();
      temp = head;
      while(temp.next != head)
        temp = temp.next;
      temp.next = newNode;
      newNode.next = head;
      newNode.prev = temp;
      head.prev = newNode;
    }    
  }

  //Search an element in the list
  void SearchElement(int searchValue) {
    Node temp = new Node();
    temp = this.head;
    int found = 0;
    int i = 0;

    if(temp != null) {
      while(true) {
        i++;
        if(temp.data == searchValue) {
          found++;
          break;
        }
        temp = temp.next;
        if(temp == this.head) {break;}
      }
      if (found == 1) {
        System.out.println(searchValue + " is found at index = " + i +".");
      } else {
        System.out.println(searchValue + " is not found in the list.");
      }
    } else {
      System.out.println("The list is empty.");
    }
  }   

  //display the content of the list
  void PrintList() {
    Node temp = new Node();
    temp = this.head;
    if(temp != null) {
      System.out.print("The list contains: ");
      while(true) {
        System.out.print(temp.data + " ");
        temp = temp.next;
        if(temp == this.head)
          break;
      }
      System.out.println();
    } else {
      System.out.println("The list is empty.");
    }
  }     
};

// test the code 
public class Implementation {
  public static void main(String[] args) {
    LinkedList MyList = new LinkedList();

    //Add three elements at the end of the list.
    MyList.push_back(10);
    MyList.push_back(20);
    MyList.push_back(30);

    //traverse to display the content of the list.
    MyList.PrintList(); 

    //search for element in the list
    MyList.SearchElement(10);
    MyList.SearchElement(15);
    MyList.SearchElement(20);
  }
}

The above code will give the following output:

The list contains: 10 20 30 
10 is found at index = 1.
15 is not found in the list.
20 is found at index = 2.