Print All Leaf Nodes of a Binary Tree

/* C++ Program to Print all leaf nodes of a Binary Tree */
#include<bits/stdc++.h>
using namespace std;

typedef struct Node
{
    int data;
    struct Node *left;
    struct Node *right;
    Node(int ele)
    {
        data = ele;
        left = NULL;
        right = NULL;
    }
} Node;

/* Function to Print all leaf nodes of a binary tree */
void printLeafNodes(Node *root)
{
    /* If root is empty, return */
    if(root == NULL)
    return;
    
    /* If root is leaf node, print data */
    if(root -> left == NULL && root -> right == NULL)
    cout<<root -> data << " ";
    
    /* If there exists left child, recursively call left subtree */
    if(root -> left)
    printLeafNodes(root -> left);
    
    /* If there exists right child, recursively call right subtree */
    if(root -> right)
    printLeafNodes(root -> right);
}

int main()
{
    /* Creating a Binary tree and inserting some nodes in it */
    Node *root = NULL;
    
    root = new Node(1);
    root -> left = new Node(2);
    root -> right = new Node(3);
    root -> left -> left = new Node(4);
    root -> left -> right = new Node(5);
    root -> right -> left = new Node(6);
    root -> right -> right = new Node (7);
    root -> left -> right -> left = new Node(8);
    root -> right -> left -> right = new Node(9);
    
    /* Calling function to print all leaf nodes of a Binary Tree */
    cout<<"The Leaf Nodes of the Tree are ";
    printLeafNodes(root);
}