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.
Step 1
Save your work and close all programs. You will be restarting your computer during the process.
Step 2
Click “Start” from the task bar and then choose “All Programs.”
Step 3
Click “Accessories” from the program menu. Choose “System Tools” from the side pop-out menu and then select “System Restore.”
Step 4
Click “Restore my computer to an earlier time” from the Welcome screen. Click “Next” at the bottom.
Step 5
Choose a date in bold from the calendar shown on the Restore Point page. The date that you choose should be an earlier one, like a day or two before the deletion occurred. Click “Next” at the bottom of the window.
Step 6
Click “Next” on the next page. The restoration begins, and your computer will restart.
Step 7
Click “OK” from the completion window that appears when your computer loads again.
Answer:
its D. in the calendar view, click the view tab, and click they overlay button.
Explanation:
i just got it right on edge 2020
Answer:
d. It is assumed that the search pool is ordered.
Explanation:
A binary search/logarithimic search/half interval search/binary chop refers to search algorithm in computer science that sorts data in array in key:value arrangements. In order to locate a value in binary search, the key to the value in a sorted array is located. A binary search is characterized by an ascending, descending order arrangement of the array.
