Print leaf node

#1

can you please send me how to take input using level order traversal.
I have figured out leaf node condn

void leafnode(node*root){
    if(root==NULL) return;
    if(root->left==NULL && root->right==NULL){
        cout<<root->data<<" ";
    }
    if(root->left)
     leafnode(root->left);
    if(root->right)
     leafnode(root->right);


}
#2

hi @darkthunderassassin_818a6616c3c74f13
refer this code -->

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.