linkedlist implementation

#include<bits/stdc++.h>
using namespace std;

class node{
    public:
    int data;
    node *next;

    node(int val){
        data=val;
        next=NULL;
    }
};

//Adding node at tail
void insertAtTail(node *&head,int val){

    node *n=new node(val);

    if(head==NULL){
        head=n;
        return ;
    }

    node *temp=head;

    while(temp->next !=NULL){

        temp=temp->next;
    }
    temp->next=n;
}


//display the linkedlist
void display(node *head){

    node *temp=head;
    while(temp !=NULL){

        cout<<temp->data<<"->";
        temp=temp->next;
    }
    cout<<"NULL";
}


//printing middle node
void middle_element(node *head){

    node *slow=head;
    node*fast=head;

    while(fast != NULL && fast->next !=NULL){
        slow=slow->next;
        fast=fast->next->next;
    }

    cout<<slow->data;
}


//main code

int main(){

    node *head=NULL;

    insertAtTail(head,1);
    insertAtTail(head,2);
    insertAtTail(head,3);
    insertAtTail(head,5);

    display(head);

    

return 0;
}