给定一个二叉树,返回其按层次遍历的节点值。 (即zhu'ceng'de,从左到右访问)。
例如:
给定二叉树: [3,9,20,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
返回其层次遍历结果为:
[ [3], [9,20], [15,7] ]
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,null,null,15,7]
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7] ]
个人思路:
利用队列进行遍历,将每一层的元素入队,每一轮出队前计算当前队列中的元素数量,即为当前层的元素数量,循环将该层元素的值存入子数组中,并把每一轮得到的子数组分别存入总数组中可得正确结果。
代码(Java):
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Queue<TreeNode> queue=new LinkedList<TreeNode>();
List<List<Integer>> visited=new LinkedList<List<Integer>>();
int row=0,col=0;
if(root!=null){queue.offer(root);}
else{return visited;}
while(!queue.isEmpty()){
int level=queue.size();
List<Integer> sub_visited=new LinkedList<Integer>();
for(int i=0;i<level;i++){
if(queue.peek().left!=null){queue.offer(queue.peek().left);}
if(queue.peek().right!=null){queue.offer(queue.peek().right);}
sub_visited.add(queue.poll().val);
}
visited.add(sub_visited);
}
return visited;
}
}