Sum of leaf nodes in binary search tree

Problem

https://practice.geeksforgeeks.org/problems/sum-of-leaf-nodes-in-bst/1

Solution

Recursive

Method: Recursive
Language: C++
Time complexity: O(n)

int sumOfLeafNodes(Node *r ){
     /*Your code here */
     if(r==NULL) return 0;
     if(r->left == NULL and r->right == NULL) return r->data;
     else return sumOfLeafNodes(r->right) + sumOfLeafNodes(r->left);
}