Linked list implementation of stack

linkedlist2.cpp

#include <iostream>
using namespace std;
struct node
{ int data;
  node* next;
};
node* head;
void push(int x)
{  node* temp=new node();
   temp->data=x;  // the new element pushed in comes between head and first node
   temp->next=head;
   head=temp;
}
void pop()
{  node* temp=head;
   head=temp->next;
   delete temp;
}
void print()
{  node* temp=head;
   while(temp!=NULL)
   {
       cout<<temp->data;
       temp=temp->next;
   } cout<<"\n";
}
int main()
{ head=NULL;
  push(1);
  push(2);
  push(3);
  print();
  pop(); //3 pops out
  print();
   
}