Answer:
B) write down all activities and commitments
Explanation:
It seems the most logical.
Answer: in C
#include <stdio.h>
int main(){
int num1, num2;
printf("Enter first number :: ");
scanf("%d", &num1);
printf("Enter second number :: ");
scanf("%d", &num2);
if(num1 > num2){
printf("%d is larger than %d\n", num1, num2);
} else if (num2 > num1) {
printf("%d is larger than %d\n", num2, num1);
} else{
printf("Both of them are equal\n");
}
return 0;
}
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:
[C], a keyboard. A keyboard can pretty much do any basic tasks that a mouse can do, given that you know the short cuts.
For example,
CTRL + Esc to open the start menu, then use the arrow keys to navigate, and return key to select.
Windows Key + R to run a program, often in the form of an executable.
And obvious much, much more.
00110001 00110100 00110000
