Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
理清条件就可以了:
(1)节点均为NULL为真
(2)只有一个节点为NULL || 两个节点的值不一样 则为假
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode *p, TreeNode *q) {
if ( p == NULL && q == NULL)
return true;
else if ( (p == NULL && q !=NULL) || (p != NULL && q == NULL) || (p->val != q->val) )
return false;
return isSameTree(p->left, q->left) & isSameTree(p->right, q->right);
}
};