Write a recursive function that calculates if two binary trees are similar?

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; i believe the correct answer to be the parents and primary groups bears most of the responsibility for socialization in the cooley's theory;

the today function returns a valid value without any arguments.

the today function returns the current date based on the computer's date setting and formatted as a date. today takes no parameters, but requires that you use empty parentheses