Below are simple way to get the MidNode... why didn't you use this?

#1

public int MidNode() throws Exception {
int mid = (getSize()-1)/2;
Node temp = GetNodeAt(mid);
return temp.data;
}

#2

@vashisthdeepak928
yeah! its a brute force approach but if suppose you interviewer ask to solve this without taking the size of the linked list.

#3

Okay got it.
Thanks!