Answer:
The new root will be 2.
<em></em>
Explanation:
The binary tree is not properly presented (See attachment)
To answer this; first, we need to order the nodes of the tree in a pre-order traversal.
We use pre-order because the question says if something is removed from the left child.
So, the nodes in pre-order form is: 14, 2, 1, 5, 4, 16.
The root of the binary tree is 14 and if 14 is removed, the next is 2.
<em>Hence, the new root will be 2.</em>
The BIOS contains the information.
Answer:
result=0;
for (i=lo ; i<=hi; i++){
result += i;
}
Explanation:
The question says result was declared but not initialized, so using result without initializing it to 0 would throw an error as result would be undefined and you can't add a number to undefined
Another way to do it to keep everything inside the loop would be
for (i=lo ; i<=hi; i++){
if (i==lo) result= 0;
result += i;
}
but this is impractical since it would add unnecesary operations in each cycle of the loop
