题意
判断二叉树是否相等:对应结点相同且值相等
题解
1:判断特殊情况,结点都为空,返回true
2:二者只有一个为空,返回false
3:既然还没有返回,那么判断的两个结点都不为空,则判断val
4:判断结点val是否相等,不等就返回false
递归判断,一直不返回false,直到判断到二叉树的左右子数都为空,返回true,然后一直递归返回。。。。。。
ps:C++ bool NULL
Java boolean null
C++实现
/**
* 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 == NULL && q == NULL)
return true;
else if(p == NULL || q == NULL)
return false;
if(p -> val != q -> val)
return false;
bool flag = isSameTree(p -> left,q -> left) && isSameTree(p -> right,q -> right);
return flag; //如果二叉树相等,则一直不会返回FALSE,直到比较到空结点,返回true
}
};
Java实现
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null && q == null)
return true;
else if(p == null || q == null)
return false;
if(p.val != q.val)
return false;
boolean flag = isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
return flag;
}
}