Answer:
Each time you insert a new node, call the function to adjust the sum.
This method has to be called each time we insert new node to the tree since the sum at all the
parent nodes from the newly inserted node changes when we insert the node.
// toSumTree method will convert the tree into sum tree.
int toSumTree(struct node *node)
{
if(node == NULL)
return 0;
// Store the old value
int old_val = node->data;
// Recursively call for left and right subtrees and store the sum as new value of this node
node->data = toSumTree(node->left) + toSumTree(node->right);
// Return the sum of values of nodes in left and right subtrees and
// old_value of this node
return node->data + old_val;
}
This has the complexity of O(n).
Explanation:
I am not too familiar with the Python language, but the algorithm would be something like this:
1. create a variable for the sums of the number
2. read in how many numbers the user wants to enter (let's call it N)
and then create a for loop:
for N times
read in the next number
increase the sum variable by that number
Hopefully this helps!
yes
Explanation:
because it has more things
True it usually shows up with a blue underline
............................
Mark me brainliest^^
