CareerCup

int sumUp(node *p){
int curr = p->data;
int left, right;

if( p-> left != null)
left = sumUp( p->left );
else
left = 0;

if ( p->right != null )
right = sunUp(p->right);
else
right = 0;

p->data = left+right;
return curr + p->data;
}

Below is my recursive solution to the problem

public int sumLR(Bnode root)
{
int temp=0,sum=0;

if(root==null)
return 0;

temp=root.getData();
sum=sumLR(root.getLeft()) + sumLR(root.getRight());

root.setData(sum);

return temp+sum ;


}

int getvalue(BST *a)
{
	//if(a==NULL) return 0;
	int value = a->data;
	a->data = 0;
	if(a->leftchild) a->data+=getvalue(a->leftchild);
	if(a->rightchild) a->data+=getvalue(a->rightchild);
	return a->data+value;
}

1. 20 & 30 are left and right child of 10
2. 40 & 50 are left and right child of 30

solution(BT root)
{
root.data = sumandzero(root);
}
public static int sumandzero(BT root)
{
int k=root.data;
if(root==null)
return 0;
if(root.left==null&&root.right==null)
{

root.data=0;
return k;
}
k+=sumandzero(root.left);

k+=sumandzero(root.right);
return k;
}

int getvalue(BST *a)
{
//if(a==NULL) return 0;
int value = a->data;
a->data = 0;
if(a->leftchild) a->data+=getvalue(a->leftchild);
if(a->rightchild) a->data+=getvalue(a->rightchild);
return a->data+value;
}

int getvalue(BST *a)
{
//if(a==NULL) return 0;
int value = a->data;
a->data = 0;
if(a->leftchild) a->data+=getvalue(a->leftchild);
if(a->rightchild) a->data+=getvalue(a->rightchild);
return a->data+value;
}

int getvalue(BST *a)
{
	//if(a==NULL) return 0;
	int value = a->data;
	a->data = 0;
	if(a->leftchild) a->data+=getvalue(a->leftchild);
	if(a->rightchild) a->data+=getvalue(a->rightchild);
	return a->data+value;
}

int getvalue(BST *a)
{
	//if(a==NULL) return 0;
	int value = a->data;
	a->data = 0;
	if(a->leftchild) a->data+=getvalue(a->leftchild);
	if(a->rightchild) a->data+=getvalue(a->rightchild);
	return a->data+value;
}

int cumulativetree( NODE* root )
{
	if( root == NULL )
		return 0;
	if( root->left == NULL && root->right == NULL ){
		temp = root->data;
		root->data = 0;
		return temp;
	}
	return (root->data += cumulativetree(ptr->right) + cumulativetree(ptr->left));
}