// editor1
#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    int data;
    struct Node*left;
    struct Node*right;
}Node;
Node*createNode(int data){
    Node*newNode=(Node*)malloc(sizeof(Node));
    return NULL;
}
newNode->data = data;
newNode->=newNode->right=NULL;
return newNode;
}
Node*insertNode(Node*root,int data){
    if(root==NULL){
        root=createNode(data);
    }else if(data<root->data){
        root->left=insertNode(root->left,data);
    }else if(data>root->data){
        root->right=insertNode(root->right,data);
    }
    return root;
}
void printLeafPostOrder(Node*root){
    if(root){
        printLeafPostOrder(root->left);
        printLeafPostOrder(root->right);
        if(root->left==NULL && root->right==NULL){
            printf("%d",root->data);
        }
    }
}
int main(){
    int n;
    printf("enter the number of integer to be inserted into the BST:");
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    Node*root=NULL;
    printf("enter the integers separated by spaces:");
    for(int i=0;i<n;i++){
        int data;
        scanf("%d",&data);
        root=insertNode(root,data);
    }
    printf("leaf nodes in post-order traversal:");
    printLeafPostOrder(root);
    printf("/n");
    return 0;
}