代码随想录算法训练营第十五天 | 102. 二叉树的层序遍历 | 226.翻转二叉树 | 101. 对称二叉树

递归三部曲

1. 确定递归函数的参数和返回值
2. 确定终止条件
3. 确定单层递归的逻辑

102. 二叉树的层序遍历

题解及想法

解法一 ：递归法

class Solution {
    public List<List<Integer>> resList = new ArrayList<List<Integer>>();

    public List<List<Integer>> levelOrder(TreeNode root) {
        checkFun01(root,0);
        return resList;
    }

    //递归
    public void checkFun01(TreeNode node,int deep){
        if(node == null){
            return;
        }
        deep++;
        if(deep >resList.size()){
            List<Integer> list = new ArrayList<Integer>();
            resList.add(list);
        }
        resList.get(deep - 1).add(node.val);
        checkFun01(node.left,deep);
        checkFun01(node.right,deep);
    }

}

解法二 ： 迭代法

如上图， 通过一个队列来辅助遍历，用size来保存每一层的个数。 

class Solution {
    public List<List<Integer>> resList = new ArrayList<List<Integer>>();

    public List<List<Integer>> levelOrder(TreeNode root) {
        checkFun02(root);
        return resList;
    }

    //迭代方式  
    public void checkFun02(TreeNode node){
        if(node == null){
            return;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(node);

        while(!queue.isEmpty()){
            int size = queue.size();
            List<Integer> list = new ArrayList<Integer>();
            while(size-- > 0){
                TreeNode node1 = queue.poll();
                list.add(node1.val);
                if(node1.left != null){
                    queue.offer(node1.left);
                }
                if(node1.right != null){
                    queue.offer(node1.right);
                }
            }
            resList.add(list);
        }
    }
}

226.翻转二叉树

题解及想法

解法一 ：递归法

 

/**
 * 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 TreeNode invertTree(TreeNode root) {
        if(root == null) return null;
        TreeNode node = root.left;
        root.left = root.right;
        root.right = node;

        invertTree(root.left);
        invertTree(root.right);

        return root;
    }
}

解法二 ： 迭代法

/**
 * 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 TreeNode invertTree(TreeNode root) {
        if(root == null) return null;
        ArrayDeque<TreeNode> deque = new ArrayDeque<>();
        deque.offer(root);
        while(!deque.isEmpty()){
            int size = deque.size(); //获取每一层的个数
            while(size-- > 0){
                TreeNode node = deque.poll();
                TreeNode temp = node.left;
                node.left = node.right;
                node.right = temp;
                if (node.left != null) deque.offer(node.left);
                if (node.right != null) deque.offer(node.right);
            }
        }
        return root;
    }
}

101. 对称二叉树

题解及想法

采用后序遍历来递归。

/**
 * 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 isSymmetric(TreeNode root) {
        return isCompare(root.left,root.right);
    }

    public boolean isCompare(TreeNode left,TreeNode right){
        if(left == null && right != null){
            return false;
        }else if(left != null && right == null){
            return false;
        }else if(left == null && right == null){
            return true;
        }else if(left.val != right.val){
            return false;
        }
        boolean left1 = isCompare(left.left,right.right);
        boolean right1 = isCompare(left.right,right.left);
        return left1 && right1;
    }
}