leetcode：Binary Tree Level Order Traversal 【Java】

一、问题描述

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]
]

二、问题分析

使用两个链表分别保存树中前一层结点和当前层结点。

三、算法代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(root == null){
            return result;
        }
        List<TreeNode> pre = new ArrayList<TreeNode>();//保存树中pre层树结点
        pre.add(root);
        int preLength = 0;
        List<TreeNode> cur = null;//保存树中当前层树结点
        List<Integer> curValue = null;//保存树的当前层树节点中数值
        TreeNode curNode = null;
        while(pre.size() != 0){
            preLength = pre.size();
            cur = new ArrayList<TreeNode>();
            curValue = new ArrayList<Integer>();
            for(int i = 0; i <= preLength - 1; i++){
                curNode = pre.get(i);
                curValue.add(curNode.val);//保存树的当前层树节点中数值
                if(curNode.left != null){
                    cur.add(curNode.left); 
                }
                if(curNode.right != null){
                    cur.add(curNode.right); 
                }
            }
            result.add(curValue);
            pre = cur;
        }
        return result;
    }
}