下面这道题来自LeetCode,记录这道题的意义在于,它不仅仅是完成了普通的树的层序遍历,而且它能给出每一层包含了哪些元素(即可以定位到每一层的结束位置)。我将它称为树层序遍历的升级版。
题目:
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]
]
解答:
关键点在于记录size的值(即每层有多少个元素)。然后遍历每层时,就从队列中出队size个值,这样就不会影响到下一层。以此类推,遍历每一层。
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
import java.util.*;
public class Solution {
public ArrayList<ArrayList<Integer>> levelOrder(TreeNode root) {
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
if(root==null)
return res;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while(!queue.isEmpty()){
int size = queue.size();
ArrayList<Integer> line = new ArrayList<Integer>();
for(int i=0; i<size; i++){
TreeNode tempNode = queue.poll();
line.add(tempNode.val);
if(tempNode.left!=null)
queue.add(tempNode.left);
if(tempNode.right!=null)
queue.add(tempNode.right);
}
res.add(line);
}
return res;
}
}