102. Binary Tree Level Order Traversal

原创于 2020-06-03 10:44:39 发布 · 221 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

本文介绍了二叉树层次遍历的两种实现方法：递归和迭代。递归方法通过深度优先搜索，按层级添加节点值；迭代方法使用队列记录每一层的节点，通过队列大小进行迭代直至所有节点被访问。

link: https://leetcode.com/problems/binary-tree-level-order-traversal/

Solution1: recursive

class Solution {
    List<List<Integer>> levels = new ArrayList<List<Integer>>();
    
    public void helper(TreeNode root, int level) {
        if(levels.size() == level) {
            levels.add(new ArrayList<Integer>());
        }
        
        levels.get(level).add(root.val);
        
        if(root.left != null) helper(root.left, level+1);
        if(root.right != null) helper(root.right, level+1);
    }
    
    public List<List<Integer>> levelOrder(TreeNode root) {
        if(root == null) return levels;
        helper(root, 0);
        return levels;
    }
}

Solution2: iterative
利用queue记录下一层，并通过当层queue的size来进行迭代

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> levels = new ArrayList<List<Integer>>();
        int level = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        if(root == null) return levels;
        queue.add(root);
        int size;
        TreeNode node;
        while(!queue.isEmpty()) {
            size = queue.size();
            levels.add(new ArrayList<Integer>());
            for(int i=0; i<size; i++) {
                node = queue.poll();
                levels.get(level).add(node.val);
                if(node.left != null) queue.add(node.left);
                if(node.right != null) queue.add(node.right);
            }
            level++;
        }
        return levels;
    }
}