Tree_leaves.cpp

#include <bits/stdc++.h>

using namespace std;

class Node {
    public:
        int data;
        Node *leftNode;
        Node *rightNode;
        Node(int d) {
            data = d;
            leftNode = NULL;
            rightNode = NULL;
        }
};

class Solution {
    public:
  		Node* insert(Node* root, int data) {
            if(root == NULL) {
                return new Node(data);
            } else {
                Node* cur;
                if(data <= root->data) {
                    cur = insert(root->leftNode, data);
                    root->leftNode = cur;
                } else {
                    cur = insert(root->rightNode, data);
                    root->rightNode = cur;
               }

               return root;
           }
        }

    int leaf_nodes(Node* root){
       
        if(root==nullptr){
            return 0;
        }
        
        if(root->leftNode==nullptr && root->rightNode==nullptr && root->data%2!=0){
            return root->data;
        }
        return (leaf_nodes(root->leftNode)+leaf_nodes(root->rightNode));
    }

	void leaves(Node *root) {
        int sum = leaf_nodes(root);
        cout<<sum<<endl;
    }


}; //End of Solution

int main() {
  
    Solution myTree;
    Node* root = NULL;
    
    int t;
    int data;

    std::cin >> t;

    while(t-- > 0) {
        std::cin >> data;
        root = myTree.insert(root, data);
    }
  
	myTree.leaves(root);
    return 0;
}_