CareerCup

boolean same_tree (TREE * head1, TREE *head2 )
{
          if((head1 && !head2) || (head2 && !head1))
                   return false;
          else
          {
                 if(head1->data == head2->data )
                 {
                             return (same_tree(head1->left,  head2->left ) && 
                                         same_tree(head1->right, head2->right))
                 }
            }
           return false;
}

Needless to say the question is too easy I guess the interviewer was not prepared

Maybe If there is no constrain.

just find the inorder and preorder of both tree and compare both the array ..if same tree is same otherwize not..

other than recursion if no extra space is allowed, might also make it slightly complicated

1) If both trees are empty return false
2) else if both trees are non-empty
a. check data of root nodes
b. check left sub tree recursively
c. check right sub tree recursively
3 Else return false

int sametree(struct node *t1, struct node *t2)
{
if(t1->data == NULL) && (t2->data==NULL))
return 0;
else if(t1->data!=NULL && t2->data!=NULL)
{
return (t1->data == t2->data) &&
sametree( t1->left,t2->left) &&
sametree(t1->right,t2->right);
}
else
return 0;
}

garimaa.blogspot.in/2012/04/program-13th-in-c.html

garimaa.blogspot.in/2012/04/program-13th-in-c_11.html