Answer:
hay un n t s en la esquina superior derecha, debe presionar eso y debe llevarlo al menú si eso no funciona, entonces tengo una idea de qué hacer
Explanation:
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:
Radio Corporation of America (RCA)
Explanation:
A corporation is not a video connector.
Answers:
What is the index of the last element in the array? stArr1.length()-1
This prints the names in order. How would I print every other value? Change line 4 to: index = index +2
Change line 7 to: i < names.length
Answer:
You need exit condition like If, otherwise method will repeat endlessly.
