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:
how many times as strong would what?
put your question in the replies to this answer and I'll gladly answer it
Explanation:
May I have brainliest please? :)
Answer:
Number of packets ≈ 5339
Explanation:
let
X = no of packets that is not erased.
P ( each packet getting erased ) = 0.8
P ( each packet not getting erased ) = 0.2
P ( X ≥ 1000 ) = 0.99
E(x) = n * 0.2
var ( x ) = n * 0.2 * 0.8
∴ Z = X - ( n * 0.2 ) / 
~ N ( 0.1 )
attached below is the remaining part of the solution
note : For the value of <em>n</em> take the positive number
Answer/Explanation:
It is best to use Performance Monitor and Process counters to observe performance.
Cheers
Answer:
IP address
Explanation:
In computer networks, every computer has assigned with a unique address that is called logical address or IP address.
This address is assigned by ICANN and used to access that particular computer by other computers on the network.
