Insert a node into a sorted doubly linked list

Problem Statement

You’re given the pointer to the head node of a sorted doubly linked list and an integer to insert into the list. Create a node and insert it into the appropriate position in the list. The head node might be NULL to indicate that the list is empty.

Input Format 
You have to complete the Node* SortedInsert(Node* head, int data) method which takes two arguments - the head of the sorted, doubly linked list and the value to insert. You should NOT read any input from stdin/console.

Output Format 
Create a node with the given data and insert it into the given list, making sure that the new list is also sorted. Then return the head node of the updated list. Do NOT print anything to stdout/console.

Sample Input

NULL , data = 2 
NULL <-- 2 <--> 4 <--> 6 --> NULL , data = 5

Sample Output

NULL <-- 2 --> NULL
NULL <-- 2 <--> 4 <--> 5 <--> 6 --> NULL

Explanation 
1. We have an empty list, 2 is inserted. 
2. Data 5 is inserted such as list remains sorted.

/*
    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.
    Node* node = (Node*)malloc(sizeof(Node));
    node->data = data;
    node->prev = NULL;
    node->next = NULL;
    if(head == NULL){
        head = node;
        return head;
    }
    if(head->next == NULL){
        if(head->data > data){
            node->next = head;
            head->prev = node;
            head = node;
            return head;
        }
    }
    Node *current = head;
    while(current->next != NULL && current->next->data < data){
        current = current->next;
    }
    if(current->next == NULL){
        current->next = node;
        node->prev = current;
    }else{
        node->prev = current;
        node->next = current->next;
        current->next->prev = node;
        current->next = node;
    }
    
    
    return head;
}