C - 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(struct Node* head_ref, int searchValue) {
  
  //1. create a temp node pointing to head
  struct Node* temp = head_ref;
  
  //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(1) {
      i++;
      if(temp->data == searchValue) {
        found++;
        break;
      }
      temp = temp->next;
      if(temp == head_ref) {break;} 
    }
    if (found == 1) {
      printf("%i is found at index = %i.\n", searchValue, i);
    } else {
      printf("%i is not found in the list.\n", searchValue);
    }
  } else {
    
    //4. If the temp node is null at the start, 
    //   the list is empty
    printf("The list is empty.\n");
  }
}

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

#include <stdio.h>
#include <stdlib.h>

//node structure
struct Node {
  int data;
  struct Node* next;
  struct Node* prev;
};

//Add new element at the end of the list
void push_back(struct Node** head_ref, int newElement) {  
  struct Node *newNode, *temp;
  newNode = (struct Node*)malloc(sizeof(struct Node)); 
  newNode->data = newElement;  
  newNode->next = NULL;
  newNode->prev = NULL;
  if(*head_ref == NULL) {
    *head_ref = newNode;
     newNode->next = *head_ref;
     newNode->prev = *head_ref;
  } else {
    temp = *head_ref;
    while(temp->next != *head_ref) {
      temp = temp->next;
    }    
    temp->next = newNode;
    newNode->next = *head_ref;
    newNode->prev = temp;
    (*head_ref)->prev = newNode;
  }
}

//Search an element in the list
void SearchElement(struct Node* head_ref, int searchValue) {
  struct Node* temp = head_ref;
  int found = 0;
  int i = 0;

  if(temp != NULL) {
    while(1) {
      i++;
      if(temp->data == searchValue) {
        found++;
        break;
      }
      temp = temp->next;
      if(temp == head_ref) {break;} 
    }
    if (found == 1) {
      printf("%i is found at index = %i.\n", searchValue, i);
    } else {
      printf("%i is not found in the list.\n", searchValue);
    }
  } else {
    printf("The list is empty.\n");
  }
} 

//display the content of the list
void PrintList(struct Node* head_ref) {
  struct Node* temp = head_ref;
  if(head_ref != NULL) {
    printf("The list contains: ");
    while (1) {
      printf("%i ",temp->data);
      temp = temp->next;
      if(temp == head_ref)
        break;    
    }
    printf("\n");
  } else {
    printf("The list is empty.\n");
  }   
}

// test the code 
int main() {
  struct Node* MyList = NULL;

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

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

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

  return 0; 
}

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.