LeetCode100.相同的树——————java

题目描述：

给你两棵二叉树的根节点 p 和 q ，编写一个函数来检验这两棵树是否相同。

如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。

示例 1：

输入：p = [1,2,3], q = [1,2,3] 输出：true 示例 2：

输入：p = [1,2], q = [1,null,2] 输出：false 示例 3：

输入：p = [1,2,1], q = [1,1,2] 输出：false

迭代法：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
  
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null&&q==null)
        {
            return true;
        }
        Queue<TreeNode> que=new LinkedList<>();
        que.offer(p);
        que.offer(q);
        while(!que.isEmpty())
        {
            TreeNode one=que.poll();
            TreeNode two=que.poll();
               if(one==null&&two==null)
            {
                continue;
            }
            if(one!=null&&two==null||one==null&&two!=null||one.val!=two.val)
            {
                return false;
            }
         
            que.offer(one.left);
            que.offer(two.left);
            que.offer(one.right);
            que.offer(two.right);
        }
        return true;
       
    }
}

递归法：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSame(TreeNode p,TreeNode q)
    {
           if(p!=null&q==null)
       {
           return false;
       }else if(p==null&&q!=null)
       {
           return false;
       }else if(p==null&&q==null)
       {
           return true;
       }else if(p.val!=q.val)
       {
           return false;
       }
      boolean left=isSame(p.left,q.left);
      boolean right=isSame(p.right,q.right);
       boolean result=left&&right;
       return result;
    }


    public boolean isSameTree(TreeNode p, TreeNode q) {
     
        return  isSame(p,q);
    }
}