LeetCode—102. Binary Tree Level Order Traversal

LeetCode—102. Binary Tree Level Order Traversal

题目

https://leetcode.com/problems/binary-tree-level-order-traversal/description/
层序遍历二叉树。

思路及解法

1.方法一
使用一个对列存储每一层的节点，同时使用列表存储当前对列每一层节点的值，一层结束后，将节点从对列出列，没出一个节点，将其的左右节点进入对列。

2.方法二
递归

代码

/**
 * 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>> result = new ArrayList<List<Integer>>();
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        if(root==null) return result;
        queue.add(root);
        while(queue.size()!=0){
            List<Integer> list = new ArrayList<>();
            
            for(TreeNode node : queue){
                list.add(node.val);
            }
            result.add(list);
            // list.clear();
            int len = queue.size();
            for(int i=0; i<len; i++){
                TreeNode node = queue.poll();
                if(node.left!=null){
                    queue.add(node.left);
                }
                if(node.right!=null){
                    queue.add(node.right);
                }
            }
        }
        return result;
    }
}

/**
 * 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>> result = new ArrayList<List<Integer>>();

        levelRecursion(root, result, 0);

        return result;
    }
    private void levelRecursion(TreeNode node, List<List<Integer>> result, int level) { 
        if (node == null)  return;  
        if (result.size() < level + 1) {// 说明还需要添加一行 
            result.add(new ArrayList<Integer>()); 
        } 
        result.get(level).add(node.val); 
        levelRecursion(node.left, result, level + 1); 
        levelRecursion(node.right, result, level + 1); 
    }

}