我正在尝试消除内存泄漏的代码，但不能完全缩小泄漏的确切位置。

void insertHead(T value){
        if(!duplicateCheck(value)){
            length++;
            if(head == NULL){
                head = new Node(value);
            }else{
                Node *temp = head;
                head = new Node(value);
                head->next = temp;
            }
        }
  }

void insertTail(T value){
        if(!duplicateCheck(value)){
            // create the node
            if(head == NULL){// insert at the insertHead
                insertHead(value); //head = newNode;
            }else{// Iterators through the linked list until a null is found
                length++;
                Node *fakeIterator = head; // once found sets the null val to newNode
                while(fakeIterator->next != NULL){
                    fakeIterator = fakeIterator->next;
                }
                fakeIterator->next = new Node(value);
            }
        }
  }

void insertAfter(T value,T insertionNode){ // seg faulting because it cant find the object oadd after
        if(!duplicateCheck(value)){
            Node *fakeIterator = head;
            while (fakeIterator != NULL) {
                    if (fakeIterator->value == insertionNode) {
                            Node *newNode = new Node(value);
                            newNode->next = fakeIterator->next;
                            fakeIterator->next = newNode;
                            length++;
                            break;
                    }
                    fakeIterator = fakeIterator->next;
            }
        }
  }

void clear(){
        Node *fakeIterator = head;
        while(fakeIterator!=NULL){
            delete head;
            fakeIterator = fakeIterator->next;
            head = fakeIterator;
        }
        head = NULL;
        length = 0;
  }

在解构函数中调用Clear函数，其主要目的是删除每个节点。我使用了valgrind，它说所有插入方法中都有内存丢失，但是我只是不确定在哪里。如果需要，我可以发布valgrind输出