方法一:递归
树相等 即 两个树的当前节点值 && 当前节点的左子树 && 当前节点的右子树 都相等。
/**
* 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 && !q) return true;
if(!p || !q) return false;
if(p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right)) {
return true;
}else {
return false;
}
}
};
方法二:迭代
/**
* 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) {
stack<TreeNode*> s;
s.push(p);
s.push(q);
while(!s.empty()) {
p=s.top();s.pop();
q=s.top();s.pop();
if(!p && !q) continue;
if(!p || !q) return false;
if(p->val != q->val) return false;
s.push(p->left);
s.push(q->left);
s.push(p->right);
s.push(q->right);
}
return true;
}
};