Segmentation fault - Linked list Insert

I'm completely stuck on this function and I keep getting segmentation fault when I run and I have no clue why.

struct Single LinkedListNode { int value; SingleLinkedListNode" next = 0; //Initialized to NULL - }; void insert (SingleLinkedListNode*s list, SingleLinkedListNode* beforeNode, const int value) { if (list->next == 0 && list->value == beforeNode->value) { Single LinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = list; list = new_node; Helse! SingleLinkedlistNode *curr = list; if (curr->value == beforeNode->value) { SingleLinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = list; list = new_node; }else{ while (curr != 0) { if (curr->next-value == beforeNode->value) { SingleLinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = curr->next; curr->next = new_node; break; } curr = curr->next; struct Single LinkedListNode { int value; SingleLinkedListNode" next = 0; //Initialized to NULL - }; void insert (SingleLinkedListNode*s list, SingleLinkedListNode* beforeNode, const int value) { if (list->next == 0 && list->value == beforeNode->value) { Single LinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = list; list = new_node; Helse! SingleLinkedlistNode *curr = list; if (curr->value == beforeNode->value) { SingleLinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = list; list = new_node; }else{ while (curr != 0) { if (curr->next-value == beforeNode->value) { SingleLinkedListNode* new_node = new SingleLinkedListNode(); new_node->value = value; new_node->next = curr->next; curr->next = new_node; break; } curr = curr->next