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] ]这是一个二叉树层次遍历的问题
首先可以用队列来做
/**
* 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) {
Queue<TreeNode> queue = new LinkedList<TreeNode>();
List<List<Integer>> result = new LinkedList<List<Integer>>();
if(root == null) return result;///注意要先判断是不是为空呀
queue.offer(root);//根节点先入队
while(!queue.isEmpty()){
int num = queue.size();
List<Integer> sublist = new LinkedList<Integer>();
for(int i =0;i<num;i++){//依次从左到右入队 num用来控制同一level的个数
if(queue.peek().left != null) queue.offer(queue.peek().left);
if(queue.peek().right != null) queue.offer(queue.peek().right);
sublist.add(queue.poll().val);
}
result.add(sublist);
}
return result;
}
}
看到有一种BFS的做法 贴一下
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<List<Integer>>();
levelHelper(res, root, 0);
return res;
}
public void levelHelper(List<List<Integer>> res, TreeNode root, int height) {
if (root == null) return;
if (height >= res.size()) {
res.add(new LinkedList<Integer>());
}
res.get(height).add(root.val);//将对应level的点依次放入对应height 的list里面
levelHelper(res, root.left, height+1);
levelHelper(res, root.right, height+1);
}