leetcode 100 递归 Java

public static class TreeNode
{
  int val;
  TreeNode left;
  TreeNode right;
  TreeNode(int x) { val = x; }
}
public boolean isSameTree(TreeNode p, TreeNode q)
{
  if(p==null&&q==null)
  {
      return  true;
  }
  else if(p!=null&&q==null)
  {
      return false;
  }
  else if(p==null&&q!=null)
  {
      return false;
  }
  else {
      if(p.val!=q.val)
      {
          return  false;
      }
      else {
          return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right);
      }
  }
}

public static void main(String[] args)
{
   Cat one  = new Cat();
   TreeNode p=new TreeNode(1);
   TreeNode p1=new TreeNode(2);
   p.right=p1;
   TreeNode q=new TreeNode(1);
   TreeNode q1=new TreeNode(2);
   q.left=q1;
   Boolean m =one.isSameTree(p,q);
   System.out.print(m);

}