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.
1. spreadsheet
2. Computers will continue to become smaller in size and become faster
Answer:
manufacturing
improving
customer care
transportation
human resource management
Explanation:
business communication use technology to improve their services or products as a way of gaining competitive advantage.
Low-power and short-latency memory access is critical to the performance of chip multiprocessor (CMP) system devices, especially to bridge the performance gap between memory and CPU
Answer:Ethernet
Explanation: I just took the question
