Answer:
public class num9 {
public static void main(String[] args) {
int sum =0;
int num =5;
for(num =5; num<=500; num+=5){
System.out.println(num);
sum +=num;
}
System.out.println(sum);
}
}
Explanation:
- Declare and initialize the variables sum and num
- Use a for loop with the condition for(num =5; num<=500; num+=5) Since the loop will increment by 5 and run from 5 to 500
- Within the loop, add num to sum at each iteration
- Print all elements on seperate lines
- Outside the loop, print the final value of sum
Create a for loop
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.
GrooveFunnels is a game-changer and it’s disrupting the market quite a bit.
