Stack Implementation in c++ (without using stack from STL)

stack.cpp

/*              Nasim             */

#include<iostream>
#include<cstdlib>
using namespace std;

class node
{
public:
    int data;
    node *next;
};

node* getNewNode(int n)
{
    node *root = new node();
    root->data = n;
    root->next = NULL;
    return root;
}

void push(int n,node **top)
{
    node *root = getNewNode(n);

    root->next = (*top);
    (*top) = root;
}

void pop(node **top)
{
    node *temp = (*top);
    (*top) = (*top)->next;
    delete temp;
}

void print(node *head)
{
    node *root = head;

    while(root != NULL)
    {
        cout<<root->data<<" ";
        root = root->next;
    }
    cout<<"\n";
    cout<<"\n";
}

void print_delete(node *head)
{
    node *root = head;

    while(root != NULL)
    {
        cout<<root->data<<" ";
        node *temp = root;
        root = root->next;
        delete temp;
    }
    cout<<"\n";
}

int main()
{
    node *top = NULL;

    push(352,&top);
    print(top);
    push(322,&top);
    print(top);
    push(312,&top);
    print(top);
    push(342,&top);
    print(top);
    pop(&top);
    print(top);
    pop(&top);
    print(top);
    push(0,&top);
    print_delete(top);
    print(top); //Garbage Value
    return 0;
}