Sorted Linked List Insertion

    void sortedInsert(node **headRef)
    {
        node *new_node;
        int key;
        printf("Which value do you wanna insert\n");
        if (scanf("%d",&key) != 1)
            return

        while (*headRef && (*headRef)->number < key)
            headRef = &(*headRef)->next;

        new_node = malloc(sizeof(*new_node));
        new_node->number = key;
        new_node->next = *headRef;
        *headRef = new_node;
    }