Linked List memory leak
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)
if(a->value <= b->value)
Where is this memory leak occuring? Valgrind points to everywhere merge is called
I don't see any leaks here.
Perhaps it's in the code that is calling merge and not in merge itself?
Topic archived. No new replies allowed.