int countLeaves(Node* root) { if(!root) return 0; if(root->left==NULL and root->right==NULL) { return 1; } return (countLeaves(root->left)+countLeaves(root->right)); }
int countLeaves(Node* root) { if(!root) return 0; if(root->left==NULL and root->right==NULL) { return 1; } return (countLeaves(root->left)+countLeaves(root->right)); }