LinkedList Application

#include <bits/stdc++.h>
 
 
LinkedList* Concatenate(LinkedList* plist1, LinkedList* plist2){
    if(plist1->head->next == NULL) return plist2;
    else if(plist2->head->next == NULL) return plist1;
    else{
        Node* cur = plist1->head->next;
        while(cur->next != NULL){
            cur= cur->next;
        }
 
        cur->next = plist2->head->next;
        free(plist2->head);
        return plist1;
    }
}
 
void Reverse(LinkedList *plist){
    Node* prev = NULL, *cur = NULL;
    Node*next = plist->head->next;
 
    while(next != NULL){
        prev = cur;
        cur = next;
        next = next->next;
        cur->next = prev;
    }
 
    plist->head->next = cur;
}