1002. 等价二叉树
Description
两个二叉树结构相同,且对应结点的值相同,我们称这两个二叉树等价.
/**
Definition for a binary tree node.
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
*/
class Solution {
public:
bool isEqual(TreeNode* p, TreeNode* q) {
if (!p && !q) return true;
if (!(p && q)) return false;
return p->val == q->val && isEqual(p->left, q->left) && isEqual(p->right, q->right);
}
};