Answer:
bool identicaltrees(Node* root1,Node* root2)//function of type boolean true if idenctical false if not.
{
if(root1==NULL&&root2==NULL)//both trees are null means identical.
return true;
if(roo1 && root2)
{
if(root1->data==root2->data)//condition for recursive call..
{
return (identicaltrees(root1->left,root2->right)&&identicaltrees(root1->right&&root2->right);
}
}
else
return false;
}
Explanation:
In this function it of type boolean returns true if both the trees are identical return false if not.First we are checking root node of both the trees if both are null then they are identical returning true.
If both root nodes are not null then checking their data.If data is same then recursively traversing on both trees and checking both trees.
else returning false.
Explanation:
how much the project will cost
Answer:
The answer is Break
<u>Explanation:</u>
When break statement is occurred then, it immediately exits from the loop and executed the statement after the loop without raising any kind of error.
<u>The situation after entering of a value by a user
</u>
- If the user entered incorrect value then it will exit from the loop.
- If the user entered correct input value, then it will run the loop for the further values.
The answer should have been B, what was the answer?
Answer:
1. x - 6
2. p - ? = 7
i chose these equations because
a number - 6 = the weight of your backpack.
p - an unknown number without a substitute variable = slices of bread left.