Better solution - using recursive solution, short, less code to write.

insertANodeInDoubleLinkedList2.cpp

/*
    Insert Node in a doubly sorted linked list 
    After each insertion, the list should be sorted
   Node is defined as
   struct Node
   {
     int data;
     Node *next;
     Node *prev
   }
*/
Node* SortedInsert(Node *head,int data)
{
    // Complete this function
   // Do not write the main method. 
    if(head==NULL)
    {
        head=(Node*)malloc(sizeof(Node));
        head->data=data;
        head->next=NULL;
        return head;
    }
    else if(data <= head->data)
    {
        Node* temp=(Node*)malloc(sizeof(Node));
        temp->data=data;
        temp->next=head;
        head->prev=temp;
        return temp;
    }
    else
    {
        head->next=SortedInsert(head->next, data);
        (head->next)->prev=head;
        return head;
    }
}