/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* middleNode(ListNode* head) {
        int count=0;
        ListNode *i=head;
        
        while(i!=NULL)
        {
            count++;
            i=i->next;
        }
        for(int i=0;i<count/2;i++)
        {
            head=head->next;
        }
        return head;
    }
};