题目描述:
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.
这个题目比较简单,2分钟就应该写出来。
public class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
if((p==null)^(q==null)||(p!=null&&q!=null&&p.val!=q.val))
return false;
if(p==null&&q==null)
return true;
return isSameTree(p.left, q.left)&&isSameTree(p.right, q.right);
}
}