// Following is the Binary Tree node structure
/**************
class BinaryTreeNode {
public :
T data;
BinaryTreeNode<T> *left;
BinaryTreeNode<T> *right;
BinaryTreeNode(T data) {
this -> data = data;
left = NULL;
right = NULL;
}
};
***************/
int sum = 0 ;
int leftSum( BinaryTreeNode< int > * root) {
// Write your code here
if ( root == NULL ) {
return 0 ;
}
if ( root- > left == NULL ) {
sum+ = root- > left- > data;
}
sum+ = leftSum( root- > left) ;
sum+ = leftSum( root- > right) ;
return sum;
}
Ly8gRm9sbG93aW5nIGlzIHRoZSBCaW5hcnkgVHJlZSBub2RlIHN0cnVjdHVyZQovKioqKioqKioqKioqKioKY2xhc3MgQmluYXJ5VHJlZU5vZGUgewogICAgcHVibGljIDogCiAgICBUIGRhdGE7CiAgICBCaW5hcnlUcmVlTm9kZTxUPiAqbGVmdDsKICAgIEJpbmFyeVRyZWVOb2RlPFQ+ICpyaWdodDsKCiAgICBCaW5hcnlUcmVlTm9kZShUIGRhdGEpIHsKICAgICAgICB0aGlzIC0+IGRhdGEgPSBkYXRhOwogICAgICAgIGxlZnQgPSBOVUxMOwogICAgICAgIHJpZ2h0ID0gTlVMTDsKICAgIH0KfTsKKioqKioqKioqKioqKioqLwppbnQgc3VtID0gMDsKaW50IGxlZnRTdW0oQmluYXJ5VHJlZU5vZGU8aW50Piogcm9vdCl7CiAgICAvLyBXcml0ZSB5b3VyIGNvZGUgaGVyZQogICAgCiAgICBpZihyb290ID09IE5VTEwpewogICAgICAgIHJldHVybiAwOwogICAgfQogICAgaWYocm9vdC0+bGVmdCA9PSBOVUxMKXsKICAgICAgICBzdW0rPXJvb3QtPmxlZnQtPmRhdGE7CiAgICB9CglzdW0rPWxlZnRTdW0ocm9vdC0+bGVmdCk7CiAgICBzdW0rPWxlZnRTdW0ocm9vdC0+cmlnaHQpOwogICAgcmV0dXJuIHN1bTsKfQo=