LeetCode_102 Binary Tree Level Order Traversal

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree {3,9,20,#,#,15,7},
3
/ \
9 20
/ \
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]

分层遍历二叉树，考虑用队列将每层的节点放入队列，用一个标志来记录扫描的所在层有几个节点

 public static  List<List<Integer>> levelOrder(TreeNode root) {
            List<List<Integer>> result = new ArrayList<List<Integer>>();

            if (root == null) return result;
            Queue<TreeNode> nodes = new LinkedList<TreeNode>();
            nodes.add(root);

            int count = 1;
            int level = 0;

            while(!nodes.isEmpty()){
                List<Integer> list = new ArrayList<Integer>();
                level = 0;
                for(int i = 0;i<count; i++){
                    root = nodes.poll();
                    list.add(root.val);
                    if (root.left!=null) {
                        nodes.add(root.left);
                        ++level;
                    }
                    if (root.right!=null) {
                        nodes.add(root.right);
                        ++level;
                    }
                }
                count = level;
                result.add(list);
            }
            return result;
        }

或者考虑用两个链表来保存当前层的节点和下一层的节点

  public List<List<Integer>> levelOrder(TreeNode root) {
      List<List<Integer>> result = new ArrayList<List<Integer>>();
      if (root == null) return result;
      LinkedList<TreeNode> currentNodes = new LinkedList<TreeNode>();
      currentNodes.add(root);
      while(!currentNodes.isEmpty()){
          LinkedList<TreeNode> nextNodes = new LinkedList<TreeNode>();
          List<Integer> list =new ArrayList<Integer>();
          for (TreeNode treeNode : currentNodes) {
            list.add(treeNode.val);
            if (treeNode.left!=null) {
                nextNodes.add(treeNode.left);
            }
            if (treeNode.right!=null) {
                nextNodes.add(treeNode.right);
            }
        }
          result.add(list);
          currentNodes = nextNodes;
      }
      return result;
  }