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.
题目描述:
判断两个二叉树是不是相同。
代码实现:
/**
* 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 isSameTree(TreeNode* p, TreeNode* q) {
if(!p&&!q) return true;//终止条件
if(!p||!q) return false;//剪枝
return (p->val==q->val && isSameTree(p->left,q->left) && isSameTree(p->right,q->right));//三方合并
}
};