Singly linked list Stack implemetation

/* Easy Stack implementation using singly linked list */
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;

void push(int x);
void pop();
void search(int y);

int nodeCounter = 1;

typedef struct alvi
{
    int data;
    struct alvi *next;
}node;
node *head = NULL;

int main(void)
{
    int choice;
    while(1)
    {
        printf("Choose 1 for PUSH , 2 for pop , 3 for search , 4 for quit. \t Select : ");
        scanf("%d",&choice);
        switch(choice)
        {
            case 1:
                int number;
                printf("Enter number to push : ");
                scanf("%d",&number);
                push(number);
                break;
            case 2:
                pop();
                break;
            case 3:
                int find;
                printf("Enter number to search : ");
                scanf("%d",&find);
                search(find);
                break;
            case 4:
                return 0;
                break;
            default:
                printf("Wrong Selection. Choose correct number \n");
                break;
        }
    }
    return 0;
}
void push(int x)
{
    node *newNode=new node();
    newNode->data=x;
    if(head==NULL)
    {
        printf("[INITIAL] Node %d pushed \n",nodeCounter);
        newNode->next=NULL;
        head=newNode;
        nodeCounter++;
    }
    else
    {
        printf("Node %d pushed \n",nodeCounter);
        newNode->next=head;
        head=newNode;
        nodeCounter++;
    }

    printf("\n");
}
void pop()
{
    node *cursor;
    cursor=head;
    while(cursor!=NULL)
    {
        printf("%d\t",cursor->data);
        cursor=cursor->next;
    }
    printf("\n");
}
void search(int y)
{
    node *pointer;
    pointer=head;
    int flag=0;
    int elementCounter=1;
    while(pointer!=NULL)
    {
        if(pointer->data==y)
        {
            flag=1;
            printf("Found.\t");
            printf("Element number : %d (Pop serial) /",elementCounter);
            printf(" %d (Push serial) \n",nodeCounter-elementCounter);
            break;
        }
        pointer=pointer->next;
        elementCounter++;
    }
    if(flag==0)
    {
        printf("Not Found. \n");
    }
    printf("\n");
}