C++ - Delete odd nodes of the Doubly Linked List

Deleting odd nodes of a doubly linked list requires traverse through the list and deleting odd nodes one by one. If the list is not null then release the head and make next of head as new head. If the new head is not null then make the next of head as null and create two nodes - evenNode and oddNode. Make evenNode to the first even node of list and oddNode to second odd node of the list (3^rd node in the original list). If both are not null, delete the oddNode and adjust links. Move both nodes to next set of even-odd nodes. Repeat the process till the any or both nodes become null.

The function deleteOddNodes is created for this purpose. It is a 5-step process.

void deleteOddNodes() {
  if(head != NULL) {
    
    //1. if head is not null, make next of head as
    //   new head and delete previous head
    Node* temp = head;
    head = head->next; 
    free(temp);   
    if(head != NULL) {

      //2. if the new head is not make prev of head as
      //   null and create nodes - evenNode and oddNode
      head->prev = NULL;
      Node* evenNode = head;
      Node* oddNode = head->next; 

      while(evenNode != NULL && oddNode != NULL) {
        
        //3. while evenNode and oddNode are not null
        //   make next of evenNode as next of oddNode 
        //   and free oddNode   
        evenNode->next = oddNode->next;
        free(oddNode);

        //4. and make temp as evenNode and evenNode as 
        //   next of evenNode
        temp = evenNode;
        evenNode = evenNode->next;
        
        //5. Update prev link, evenNode and oddNode
        if(evenNode != NULL) {
          evenNode->prev = temp;
          oddNode = evenNode->next;
        }
      }
    }
  }
}

The below is a complete program that uses above discussed concept of deleting odd nodes of a doubly linked list.

#include <iostream>
using namespace std;

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

class LinkedList {
  private:
    Node* head;
  public:
    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->prev = NULL; 
      if(head == NULL) {
        head = newNode;
      } else {
        Node* temp = head;
        while(temp->next != NULL)
          temp = temp->next;
        temp->next = newNode;
        newNode->prev = temp;
      }    
    }

    //delete odd nodes of the list
  	void deleteOddNodes() {
  	  if(head != NULL) {
  	    Node* temp = head;
  	    head = head->next; 
  	    free(temp);   
  	    if(head != NULL) {
  	      head->prev = NULL;
  	      Node* evenNode = head;
  	      Node* oddNode = head->next; 
  	      while(evenNode != NULL && oddNode != NULL) {
  	        evenNode->next = oddNode->next;
  	        free(oddNode);
  	        temp = evenNode;
  	        evenNode = evenNode->next;
  	        if(evenNode != NULL) {
  	          evenNode->prev = temp;
  	          oddNode = evenNode->next;
  	        }
  	      }
  	    }
  	  }
  	} 

    //display the content of the list
    void PrintList() {
      Node* temp = head;
      if(temp != NULL) {
        cout<<"The list contains: ";
        while(temp != NULL) {
          cout<<temp->data<<" ";
          temp = temp->next;
        }
        cout<<endl;
      } else {
        cout<<"The list is empty.\n";
      }
    }    
};

// test the code 
int main() {
  LinkedList MyList;

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

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

  //delete odd nodes of the list
  MyList.deleteOddNodes();

  cout<<"After deleting odd nodes.\n";
  //Display the content of the list.
  MyList.PrintList();
  
  return 0; 
}

The above code will give the following output:

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