Splitting a singly linked list for merge sort C++

Hi everyone

I am trying to do a merge sort on a singly linked list with 10000 nodes in it. I am really new to this and it would be great to keep everything as basic as possible. Can anyone help me create a simple splitting method that can at least half a linked list over and over again?

Here is my node class:

Code:

class Node
{
public:
	int data;
	Node* next;
	Node()
	{
		next = NULL;
		data = 0;
	}
	Node* Split();
};

and in my list class I have this within it:

Code:

	Node* head;
	Node* current;
	Node* tail;

 

Hmmm, sounds like second year advanced programming from the University of Hull, that right?