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 (!isSameTree(p.left, q.left))
return false;
if (p.val != q.val)
return false;
if (!isSameTree(p.right, q.right))
return false;
}else if(p==null && q==null)
return true;
else
return false;
return true;
}