Well there are 4 cylinders but there are also, 6, 8, 12, 16
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:
Dex: 84
Hex: 54
Bin: (1010100)
Explanation:
You keep on dividing by 16 until you get 0 to find the hexadecimal then use the remainders from the last to the first.
The right answer is : is.lower(letter)
