程序完全退出

while ((temp->x < new_node->x)&&(temp != NULL))

但当编写为

while((temp!=NULL) &&(temp->x < new_node->x))

这是我的代码。

Node *insert(Node *head)
{
    Node *new_node = (Node *)malloc(sizeof(Node));
    new_node->next = NULL;
    printf("\nEnter x: ");
    scanf("%d", &new_node->x);
    if (head == NULL)
        return new_node;
    else
    {
        Node *prev = NULL, *temp = head;
        while ((temp->x < new_node->x)&&(temp != NULL))  // but, ((temp!=NULL) &&(temp->x < new_node->x)) runs 
        {
            prev = temp;
            temp = temp->next;
        }
        new_node->next = temp;
        if (prev == NULL) // Node needs to insert at beginning to maintain the sorting of Linked List
            return new_node;
        prev->next = new_node;
        return head;
    }
}