Linked List - Stack

[Wait for it]

Hello, I need help because my destructor is not working, I need some help because it is the only thing left that I have to do and I dont know what is wrong.

Here is my code:

#include <iostream>

using namespace std;

class LinkedL {
      private:
              struct node{
                     int data;
                     node *link;
                     };
              node *top;
      
      public:
             LinkedL();
             ~LinkedL();
             void Push(int);
             int Pop();
             int RetrieveStack();
             bool StackIsEmpty();
             void display();
      };
      
LinkedL::LinkedL(){

                  top = NULL;                  

}

void LinkedL::Push(int element){
     node *p = new node;
     p -> data = element;
     p -> link = top;
     top = p;
     
}
     
int LinkedL::Pop(){
     if(StackIsEmpty()){}                   
     else{
          node *temp = top;
          top = temp -> link;
          return temp -> data;
          }
}

int LinkedL::RetrieveStack(){
     if(StackIsEmpty()){}                   
     else{
          return top -> data;
          } 
}

bool LinkedL::StackIsEmpty(){
    if(top == NULL){
           return true;
           }
    else{
         return false;
         }  
    
}

void LinkedL::display(){
     node *p = top;
     if(StackIsEmpty()){}                   
     else{
          while(top != NULL){
                  cout << p -> data;
                  p = p -> link;
                  }
          }     

}

LinkedL::~LinkedL(){    
    node *cursor;
    while(top != NULL){     
              cursor = top;
              top = top->link;
              delete cursor;     
              }
}

int main() {
    LinkedL hola;
    
    hola.Push(10);
    hola.Push(20);
    hola.Push(30);
    hola.Push(40);
    hola.Push(50);
    
    hola.display();
    
    hola.Pop();
    
    hola.display();
    
    hola.display();
    
    
    system("Pause");
    return 0;
}