Pop() in Linked List in C++

 int pop() {

if(isEmpty(top)) 
{ 

cout << "Stack underflow << endl;

return -1;

}

else 

{

Node* n = top;

int x = n->data;

top=top->next;

free(n);

return x;

     }
}