[LeetCode]100. Same Tree

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.

方法一：用队列层序遍历（我的方法）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean check(TreeNode p, TreeNode q){
        if(p==null && q!=null) return false;
        if(q==null && p!=null) return false;
        if(p!=null && q!=null) return true;
        
        return false;
    }
    
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null && q!=null) return false;
        if(q==null && p!=null) return false;
        if(p==null && q==null) return true;
        
        Queue<TreeNode> que1 = new LinkedList<>();
        Queue<TreeNode> que2 = new LinkedList<>();
        
        que1.offer(p);
        que2.offer(q);
        
        while(!que1.isEmpty() && !que2.isEmpty()){
            TreeNode temp1 = que1.poll();
            TreeNode temp2 = que2.poll();
            if(temp1.val!=temp2.val) return false;
            if(temp1.left!=null || temp2.left!=null){
                if(check(temp1.left, temp2.left))
                {
                    que1.offer(temp1.left);
                    que2.offer(temp2.left);
                }
                else return false;
            }
            
            if(temp1.right!=null || temp2.right!=null){
                if(check(temp1.right, temp2.right))
                {
                    que1.offer(temp1.right);
                    que2.offer(temp2.right);
                }
                else return false;
            }
        }
        
        if(!que1.isEmpty() || !que2.isEmpty())
            return false;
        
        return true;
    }
}

方法二：递归（重点）

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