Linked List memory leak

[rocketman]

So, I'm implementing mergesort using Nodes and Linked Lists. Running my program through valgrind, all of my leaks originate from my merge function.

LList<int>::Node* merge(LList<int>::Node *a, LList<int>::Node *b)
{
	LList<int>::Node* endlist=NULL;
	if(a==NULL)return b;
	if(b==NULL)return a;
	if(a->value <= b->value)
	{
			endlist=a;
			endlist->next=merge(a->next,b);
	}
	else
	{
		endlist=b;
		endlist->next=merge(a,b->next);
	}
	return endlist;
}

Where is this memory leak occuring? Valgrind points to everywhere merge is called

[Disch]

I don't see any leaks here.

Perhaps it's in the code that is calling merge and not in merge itself?