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.
分析:递归实现,空与非空的判断,若p->val == q->val 则递归判断。
/**
* 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;
//两个不都为空
if( (p == NULL && q != NULL) || (p != NULL && q == NULL) ) return false;
//两个都不为空
if(p->val != q->val) return false;
//当前节点val相等
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
};