Finding middle element in a linked list.cpp

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

struct Node
{
    int data;
    struct Node* next;
    
    Node(int x){
        data = x;
        next = NULL;
    }
};
void printList(Node* node) 
{ 
    while (node != NULL) { 
        cout << node->data <<" "; 
        node = node->next; 
    }  
    cout<<"\n";
} 


class Solution{
    public:
    /* Should return data of middle node. If linked list is empty, then  -1*/
    int getMiddle(Node *head)
    {
       
        if(head==NULL)
        return 0;
        
        int c=0;
        int middle;
        int c1=0;
        Node* temp=head;
        Node* temp1=head;
        while(temp)
        {
            c++;
            temp=temp->next;
        }
       
        middle=(c/2)+1;
     
        while(temp1)
        {
            c1++;
            if(middle==c1)
            {
                return  temp1->data;
            }
            temp1=temp1->next;
            
        }
        
        
        
    }
};


//{ Driver Code Starts.

int main() {
    //code
    int t;
    cin>>t;
    while(t--){
        int N;
        cin>>N;
        int data;
        cin>>data;
        struct Node *head = new Node(data);
        struct Node *tail = head;
        for (int i = 0; i < N-1; ++i)
        {
            cin>>data;
            tail->next = new Node(data);
            tail = tail->next;
        }
        
        Solution ob;
        cout << ob.getMiddle(head) << endl;
    }
    return 0;
}