This code attempts to fuse two strings together. So,
fuse("Apple", "Banana")
would return "ABpapnlaen a"
However, there are a couple of things wrong with this code:
- The for loop is incomplete (probably a copy paste error)
- It is unclear from the code if the array jawaban will overflow if kata1 and kata2 are large (it probably will)
- Biggest problem: the jawaban array is declared on the stack, which means it will be cleaned up when the function returns. So the caller of this function will reference unallocated memory! This is a huge bug!!
Answer:
- pray the god for your answer
Explanation:
I lllllllllllllll believe the Jesus
Answer:
Drop down list
Explanation:
You have not listed what the possible answers are, however a drop down list would be an option to accomplish this.
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:
