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.
* 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)||(q == null&&p != null))
return false;
if(p.val==q.val){
boolean flagLeft = isSameTree(p.left,q.left);
boolean flagRight = isSameTree(p.right,q.right);
if(flagLeft ==true&&flagRight == true)
return true;
return false;
}
return false;
}
}
后来看了一下评论区,发现有这么写的,虽然方法都一样,但是代码却简洁很多
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p == null || q==null) return p==q;
return (p.val == q.val)&&isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
}