LeetCode 102 二叉树的层次遍历 Java

题目描述

给定一个二叉树，返回其按层次遍历的节点值。 （即逐层地，从左到右访问所有节点）。

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        if (root == null) return res;
        levelOrderTree(root, res);
        return res;
    }
    
    public void levelOrderTree(TreeNode root, List<List<Integer>> res){
        int curCount = 1;
        int nextCount = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        List<Integer> list = new ArrayList(); 
        while( !queue.isEmpty()){
            TreeNode cur = queue.poll();
            list.add(cur.val);
            curCount--;
            if(cur.left != null){
                queue.offer(cur.left); // 左节点入队
                nextCount++;
            }
            if (cur.right != null){
                queue.offer(cur.right); // 右节点入队
                nextCount++;
            }
            if (curCount == 0){ // 当前层遍历完成
                res.add(list);
                list =  new ArrayList(); 
                curCount = nextCount;
                nextCount = 0;
            }
        }
    }
}