leetcode102. 二叉树的层序遍历

1.题目描述：

给你二叉树的根节点root，返回其节点值的层序遍历。（即逐层地，从左到右访问所有节点）。

2.层序遍历：

/**
 * 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 List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> resList = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        if (root == null) return resList;
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();//借助size区分不同层
            List<Integer> list = new ArrayList<>();
            while (size > 0) {
                TreeNode temp = queue.poll();
                size--;
                list.add(temp.val);
                if (temp.left != null) queue.offer(temp.left);
                if (temp.right != null) queue.offer(temp.right);
            }
            resList.add(list);
        }
        return resList; 
    }
}

 3.递归解法，深度优先：

class Solution {
    private List<List<Integer>> list = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        dfs(root, 1);
        return list;
    }

    public void dfs(TreeNode root, int depth) {
        if (root == null) return;
        if (depth > list.size()) list.add(new ArrayList<>());//新开一层
        list.get(depth - 1).add(root.val);//添加到对应层
        dfs(root.left, depth + 1);
        dfs(root.right, depth +1);
    }
}