Function to insert a new_node in the list in sorted fashion Note that this function expects a pointer to head node as this can modify the head of the input linked list
Node * sortedInsert ( Node * head_ref , Node * new_node ) { Node * current = head_ref ;