剑指offer---58.对称的二叉树

题目描述

请实现一个函数，用来判断一颗二叉树是不是对称的。注意，如果一个二叉树同此二叉树的镜像是同样的，定义其为对称的。

解法一：利用两个队列

思路：自己写的，最初想利用一个队列，后来发现不行。

import java.util.*;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    boolean isSymmetrical(TreeNode pRoot) {
        if(pRoot==null) return true;
        if(pRoot.left==null&&pRoot.right==null) return true;
        TreeNode leftnode = pRoot.left;
        TreeNode rightnode = pRoot.right;
        if(leftnode==null||rightnode==null) return false;
        //借助层序遍历
        LinkedList<TreeNode> l = new LinkedList<>();
        LinkedList<TreeNode> r = new LinkedList<>();
        l.add(pRoot.left);
        r.add(pRoot.right);
        while((!l.isEmpty())&&(!r.isEmpty())){
            TreeNode lnode = l.poll();
            TreeNode rnode = r.poll();
            if(lnode.val!=rnode.val) return false;
            if(lnode.left!=null||rnode.right!=null){
                if(lnode.left==null||rnode.right==null) return false;
                l.add(lnode.left);
                r.add(rnode.right);
            }
            if(lnode.right!=null||rnode.left!=null){
                if(lnode.right==null||rnode.left==null) return false;
                l.add(lnode.right);
                r.add(rnode.left);
            }
        }
        return true;
    }
}

解法二：递归

/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    boolean isSymmetrical(TreeNode pRoot) {
       if(pRoot==null) return true;
        return judge(pRoot.left,pRoot.right);
    }
    private boolean judge(TreeNode leftnode,TreeNode rightnode){
        if(leftnode==null) return rightnode==null;
        if(rightnode==null) return false;
        if(leftnode.val!=rightnode.val) return false;
        return judge(leftnode.left,rightnode.right)&&judge(leftnode.right,rightnode.left);
    }
}

解法三：DFS

思路： 牛啊

import java.util.*;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    boolean isSymmetrical(TreeNode pRoot){
        if(pRoot==null) return true;
        Stack<TreeNode> stack = new Stack<>();
        stack.push(pRoot.left);
        stack.push(pRoot.right);
        while(!stack.isEmpty()){
            TreeNode right = stack.pop();
            TreeNode left = stack.pop();
            if(left==null&&right==null) continue;
            if(right==null||left==null) return false;
            if(left.val!=right.val) return false;
            stack.push(left.left);
            stack.push(right.right);
            stack.push(left.right);
            stack.push(right.left);
        }
    
        return true;
    }
}

解法三：BFS

思路： 牛啊

import java.util.*;
/*
public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}
*/
public class Solution {
    boolean isSymmetrical(TreeNode pRoot){
        if(pRoot==null) return true;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(pRoot.left);
        queue.offer(pRoot.right);
        while(!queue.isEmpty()){
            TreeNode right = queue.poll();
            TreeNode left = queue.poll();
            if(left==null&&right==null) continue;
            if(right==null||left==null) return false;
            if(left.val!=right.val) return false;
            queue.offer(left.left);
            queue.offer(right.right);
            queue.offer(left.right);
            queue.offer(right.left);
        }
    
        return true;
    }
}