# C - Delete even nodes of the Circular Doubly Linked List

Deleting even nodes of a circular doubly linked list requires traverse through the list and deleting even nodes one by one. It requires creating two nodes - oddNode and evenNode. If the list contains more than one node, make oddNode to first odd node of list and evenNode to first even node of the list. Store the current odd node into temp node and delete the even node. Move both nodes to next set of odd-even nodes. Repeat the process till any of nodes reaches head. Finally, link the last node with the head.

The function deleteEvenNodes is created for this purpose. It is a 3-step process.

```void deleteEvenNodes(struct Node** head_ref) {

//1. if the list has more than one element
//   create evenNode node - pointing to head
//   oddNode node - pointing to next of head
//   temp node - to store last odd node
struct Node* temp;

while(1) {

//2. delete even node and update evenNode and
//   oddNode to next set of odd-even nodes
//   update temp node to latest oddNode node
//   continue the process till any of the node
temp = oddNode;
oddNode->next = evenNode->next;
oddNode->next->prev = oddNode;
free(evenNode);
oddNode = oddNode->next;
evenNode = oddNode->next;
break;
}

//3. if oddNode reaches head, make next of
//   temp as head else make next of oddNode
} else {
}
}
}
```

The below is a complete program that uses above discussed concept of deleting even nodes of a 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;
} else {
temp = temp->next;
}
temp->next = newNode;
newNode->prev = temp;
}
}

//delete even nodes of the list
struct Node* temp;
while(1) {
temp = oddNode;
oddNode->next = evenNode->next;
oddNode->next->prev = oddNode;
free(evenNode);
oddNode = oddNode->next;
evenNode = oddNode->next;
break;
}
} else {
}
}
}

//display the content of the list
printf("The list contains: ");
while (1) {
printf("%i ",temp->data);
temp = temp->next;
break;
}
printf("\n");
} else {
printf("The list is empty.\n");
}
}

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

//Add five elements in the list.
push_back(&MyList, 10);
push_back(&MyList, 20);
push_back(&MyList, 30);
push_back(&MyList, 40);
push_back(&MyList, 50);

//Display the content of the list.
PrintList(MyList);

//delete even nodes of the list
deleteEvenNodes(&MyList);

printf("After deleting even nodes.\n");
//Display the content of the list.
PrintList(MyList);

return 0;
}
```

The above code will give the following output:

```The list contains: 10 20 30 40 50
After deleting even nodes.
The list contains: 10 30 50
```

5