Day-070.cpp

 #include<iostream>
 using namespace std;
template <typename T>
 class BinaryTreeNode {
      public :
        T data;
        BinaryTreeNode<T> *left;
        BinaryTreeNode<T> *right;

        BinaryTreeNode(T data) {
                this -> data = data;
                left = NULL;
                right = NULL;
        }
    };
    void inorder(BinaryTreeNode<int> *root,int &count){
    //base case
    if(root==NULL){
        return;
    }
    inorder(root->left,count);
    
    if(root->left == NULL && root->right ==NULL){
        count++;
    }
    inorder(root->right,count);
}
int noOfLeafNodes(BinaryTreeNode<int> *root){
    int count = 0;
    inorder(root,count);
    return count;
}
 int main (){
    BinaryTreeNode<int> *root = NULL;
    
    cout << "no of leaf nodes" << noOfLeafNodes(root);
 return 0;
 }