Identical Binary Search Trees?

Given two binary trees, return true if they are structurally identical — they are made of nodes with the same values arranged in the same way.

Check for each data with the corresponding data in the other tree, return true if the check never fails.

bool identical(struct tnode* a, struct tnode* b){
if (a==NULL && b==NULL){
return(true);
}else if (a!=NULL && b!=NULL){
return(a->data == b->data && identical(a->left, b->left) &&
identical(a->right, b->right));
}else
return(false);
}