69. 二叉树的层次遍历

69. 二叉树的层次遍历

给出一棵二叉树，返回其节点值的层次遍历（逐层从左往右访问）

样例

样例 1:

输入：{1,2,3}

输出：[[1],[2,3]]

解释：

1

/ \

2 3

它将被序列化为{1,2,3}

层次遍历

样例 2:

输入：{1,#,2,3}

输出：[[1],[2],[3]]

解释：

1

\

2

/

3

它将被序列化为{1,#,2,3}

层次遍历

挑战

挑战1：只使用一个队列去实现它

挑战2：用BFS算法来做

注意事项

• 首个数据为根节点，后面接着是其左儿子和右儿子节点值，"#"表示不存在该子节点。

• 节点数量不超过20。

/**

* Definition of TreeNode:

* public class TreeNode {

*     public int val;

*     public TreeNode left, right;

*     public TreeNode(int val) {

*         this.val = val;

*         this.left = this.right = null;

*     }

* }

*/





public class Solution {

    /**

     * @param root: A Tree

     * @return: Level order a list of lists of integer

     */

    public List<List<Integer>> levelOrder(TreeNode treeNode) {

        // write your code here

        List<List<Integer>> ret=new ArrayList<>();

        if(treeNode== null)return ret;

         Queue<TreeNode> stack = new LinkedList<>();

            stack.add(treeNode);

            while (!stack.isEmpty()) {

                List<Integer> integerList = new ArrayList<>();

                Queue<TreeNode> stack2 = new LinkedList<>();

                while (!stack.isEmpty()) {

                    treeNode = stack.poll();

                    integerList.add(treeNode.val);

                    if (treeNode.left != null) {

                        stack2.add(treeNode.left);

                    }

                    if (treeNode.right != null) {

                        stack2.add(treeNode.right);

                    }

                }

                stack=stack2;

                if (!integerList.isEmpty()) {

                    ret.add(integerList);

                }

            }

            return ret;

            

    }

}