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.
Answer:
see attached picture
Explanation:
An algorithm would be:
if hours < 10 then bonus = 0
else if hours <= 15 then bonus = 1000
else if hours <= 20 then bonus = 1500
else if hours <= 25 then bonus = 2000
else if hours <= 30 then bonus = 3000
else bonus = 5000
Answer:
Explanation:
The following pseudocode for this method using operations of the ADT list would be the following
swap(aList, indexI, indexJ) {
initialize temp_variable = Retrieve(indexI, aList)
Insert(Retrieve(indexJ, aList), indexI, aList)
Insert(Retrieve(indexI, aList), temp_variable, aList)
}
This code basically saves the aList index of i , into a temporary Variable. Then it sets the aList index of i to the value of the element in index of j. Then it does the same for the index of j with the tem_variable. If we assume that the indexes of i and j exist, then it can crash our entire program if those indexes are missing from the list when we try to access them.
I think it’s true that you can select image properties from the image menu
Right click and it should give u a option to be able to edit then right the code then right click again and save and ur done
