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:
Answer:
replace()
Explanation:
The history object in javascript corresponds to browsing history.
It has the following methods for navigating through the history list:
back(): Go back in the history list
forward(): Go forward in the history list
go() : Navigate to the currently pointed url in the history list. It takes a parameter which can either be a numeric index or a string which is matched with the history list content.
replace() is not a method in the history object.
Has lost the ability to make wise decisions and is a risk and danger on the road
Planning and analysis, due dates and payment details .
Answer:
The answer to this question is given below in the explanation section. However, the correct option is B. i.e a for loop.
Explanation:
The correct answer to this question is for-loop. Beause, in the for loop is written to perform a certain number of iterations or to iterate until a specific result is achieved.
for example, to calculate the average of 10 numbers, we use the for loop to iterate statements written in its body 10 times to calculate the average.
when the specific numbers of the iteration are reached it will get terminated.
for example
for (int i=0; i<=10; i++)
{
// perfrom average, code
}
this loop iterate 10 times or less, when it reached above the limit it gets stopped.
however, the other options are not correct, because an ordered data structure is like a list of order data, print function print something to the user or on screen. while an array is like a list of data of the same data type.
