How the C language intercepts part of a linked list

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node* next;
} Node;

Node* createNode(int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    if(newNode == NULL) {
        printf("Error creating a new node.\n");
        exit(0);
    }
    newNode->data = data;
    newNode->next = NULL;

    return newNode;
}

Node* sliceLinkedList(Node* head, int start, int end) {
    Node* current = head;
    Node* startNode = NULL;
    Node* endNode = NULL;

    // Locate the start and end nodes
    while(current != NULL) {
        if(current->data == start) {
            startNode = current;
        }
        if(current->data == end) {
            endNode = current;
            break;
        }
        current = current->next;
    }

    if(startNode != NULL && endNode != NULL) {
        endNode->next = NULL;
        return startNode;
    }

    return NULL;
}

int main() {
    Node* head = createNode(1);
    head->next = createNode(2);
    head->next->next = createNode(3);
    head->next->next->next = createNode(4);
    head->next->next->next->next = createNode(5);
    head->next->next->next->next->next = createNode(6);

    Node* sliced = sliceLinkedList(head, 2, 5);

    Node* current = sliced;
    while(current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }

    return 0;
}