2.21 Dynamic stack CPP

#include<iostream>
#include<stdlib.h>
int S_size = 0; // dynamic size of stack
struct Node{
    int value;
    struct Node *next;
};
typedef struct Node Node;
struct Node *head = NULL;

void Insertion(int ele){
    Node *temp = new Node;
    if( temp == NULL){
        printf("\nmemory is not allocated");
        return;
    }
    temp->value = ele;
    if(S_size==0){
        temp->next = head;
        head = temp;
    }
    else{
        struct Node *ptr = head;
        int point = S_size-1;
        while(point--){
            ptr = ptr->next;
        }
        temp->next = ptr->next;
        ptr->next = temp;
    }
    S_size++;
}
void Deletion(){
    if(head == NULL){
        printf("\nStack is empty");
        return;
    }
    Node* dele = head;
    if(S_size == 1){
        head = NULL;
        free(dele);
    }
    else{
        Node *ptr = head;
        int point = S_size-2;
        while(point--){
            ptr = ptr->next;
        }
        dele = ptr->next;
        ptr->next = ptr->next->next;
        free(dele);
    }
    S_size--;
}
void Print(){
    Node *ptr  = head;
    while(ptr != NULL){
        printf("%d ",ptr->value);
        ptr = ptr->next;
    }
}
int main()
{
    int choice,ele,key;
    while(1){
        printf("\n1 for insertion\n2 for deletion\nany to key just print the stack\n");
        scanf("%d",&choice);
        if(choice == 1){
            printf("\nEnter the element ");
            scanf("%d",&ele);
            Insertion(ele);
        }
        else if (choice == 2){
            Deletion();
        }
        else Print();
        printf("\n1 to repeat and any key to exit ");
        scanf("%d",&key);
        if(key != 1) break;
    }
    return 0;
}