@@ -0,0 +1,1349 @@
+package me.wayne.leetcodetop100.binarytree;%0A%0Aimport java.util.ArrayList;%0Aimport java.util.Collections;%0Aimport java.util.LinkedList;%0Aimport java.util.List;%0Aimport java.util.Queue;%0A%0Aimport me.wayne.leetcodetop100.TreeNode;%0A%0A/**%0A * %E7%BB%99%E4%BD%A0%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E6%A0%B9%E8%8A%82%E7%82%B9 root %EF%BC%8C%E8%BF%94%E5%9B%9E%E5%85%B6%E8%8A%82%E7%82%B9%E5%80%BC %E8%87%AA%E5%BA%95%E5%90%91%E4%B8%8A%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86 %E3%80%82%0A * %EF%BC%88%E5%8D%B3%E6%8C%89%E4%BB%8E%E5%8F%B6%E5%AD%90%E8%8A%82%E7%82%B9%E6%89%80%E5%9C%A8%E5%B1%82%E5%88%B0%E6%A0%B9%E8%8A%82%E7%82%B9%E6%89%80%E5%9C%A8%E7%9A%84%E5%B1%82%EF%BC%8C%E9%80%90%E5%B1%82%E4%BB%8E%E5%B7%A6%E5%90%91%E5%8F%B3%E9%81%8D%E5%8E%86%EF%BC%89%0A * %3Cp%3E%0A * https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/%0A */%0Apublic class LC107_LevelOrderBottom %7B%0A%0A    public List%3CList%3CInteger%3E%3E levelOrderBottom(TreeNode root) %7B%0A        if (root == null) %7B%0A            return Collections.emptyList();%0A        %7D%0A%0A        List%3CList%3CInteger%3E%3E res = new LinkedList%3C%3E();%0A        Queue%3CTreeNode%3E queue = new LinkedList%3C%3E();%0A        queue.offer(root);%0A        while (!queue.isEmpty()) %7B%0A            List%3CTreeNode%3E nodes = new ArrayList%3C%3E();%0A            while (!queue.isEmpty()) %7B%0A                TreeNode node = queue.poll();%0A                nodes.add(node);%0A            %7D%0A%0A            List%3CInteger%3E result = new ArrayList%3C%3E();%0A            for (TreeNode node: nodes) %7B%0A                result.add(node.val);%0A                if (node.left != null) %7B%0A                    queue.offer(node.left);%0A                %7D%0A                if (node.right != null) %7B%0A                    queue.offer(node.right);%0A                %7D%0A            %7D%0A            res.add(0, result);%0A        %7D%0A        return res;%0A    %7D%0A%7D%0A

add LC107_LevelOrderBottom