About the sum of all the nodes

#1

return root->data + count(root->left->data) + count(root->right->data) we will make this modification in the count function , right?

#2

make a seperate function

int addBT(Node* root)
{
if (root == NULL)
return 0;
return (root->key + addBT(root->left) + addBT(root->right));
}