Why does this lead to a memory leak

#include <iostream>
using namespace std;
class node{
long long data[1000];
double moredate[100];
public:
    node *n; node *p;
    node(void){ n=p=0; };
    ~node(){};
};
class linkedlist{
node *head, *tail;
unsigned long long int size;
public:
    linkedlist(){
        head=tail=new node();
        size=1;
    }
    ~linkedlist(){
        node *t=head;
        node *tt=0;
        for(;size>0;size--){
            tt = t->n;
            delete t;
            t=tt;
        }
    }
    void makeL(){
        node *t;
        for(unsigned long long int i=0;i<100000; i++){
            size++;
            t=new node();
            t->p=tail;tail->n=t;tail=t;
        }
        return;
    }
};

int main(){
    while(1){
    linkedlist *L= new linkedlist();
    L->makeL();
    char x;
    cout<<"made";
    cin>>x;
    delete L;
    cout<<"deleted";
    cin>>x;
    }
    return 0;
}

I'm deleting all the dynamic data aren't I?

becuase lol seeples

read SICP

I have.

How to make a linked list:

(list 'oh 'my 'god 'so 'difficult)

>>5

That's lisp, not C++. OP needs C++.

Also, make a dynamic array in lisp.

>>6
(vector 'oh 'my 'god 'so 'difficult)

>>6
No, my young novice. The OP needs Lisp.

memory fragmentation

>>1
DKIYT, what is the maximum value of your size_t? it looks like you're allocating a bit more than 6 and a half gigs.

why does this post lead to you checking my doubles

Because you're using C++. C master race repoting in.

From first glance it looks like head is leaking.

head never gets assigned to anything in makel - you lose the reference to your linked list you create
dont allow an object to be in a half constructed state dum dum

your code isn't exception safe either, thanks to C++.

Silly SEPPLESfags.

>>14
List didn't get head, lol
He has the reference to everything from the tail right?
t->p=tail;tail->n=t;tail=t;
and initially head is tail in the constructor


linkedlist *L= new linkedlist();
delete L
problem?