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.
中文:给定两二叉树,写一个函数检查他们相等与否。
如果两棵二叉树结构相同并且节点有相同的值,就认为他们相等。
递归检查左=左,右=右。注意空的情况。
public boolean isSameTree(TreeNode p, TreeNode q) {
if(p != null && q != null){
if(p.val == q.val)
return (isSameTree(p.left,q.left) && isSameTree(p.right,q.right));
else
return false;
}else if(p == null && q == null)
return true;
else
return false;
}