is this aproch corrrect?
if we set Start node at head and end node at tail and then
while(start<end){
start++;
end–;
}
Syso(start.data);
Will this work?
Mid Node of Linked List (Other Approach)
Yes,it does work but it ll take more time.
You should try the slow and fast pointer approach or keep a mid pointer and a count.Make an iterative loop for i for the length.Move the mid pointer to the next node every time u reach an odd count.
Please mark your doubt as resolved if you are satisfied and you can give ratings too based on my response 