link: https://leetcode.com/problems/binary-tree-level-order-traversal/
Solution1: recursive
class Solution {
List<List<Integer>> levels = new ArrayList<List<Integer>>();
public void helper(TreeNode root, int level) {
if(levels.size() == level) {
levels.add(new ArrayList<Integer>());
}
levels.get(level).add(root.val);
if(root.left != null) helper(root.left, level+1);
if(root.right != null) helper(root.right, level+1);
}
public List<List<Integer>> levelOrder(TreeNode root) {
if(root == null) return levels;
helper(root, 0);
return levels;
}
}
Solution2: iterative
利用queue记录下一层,并通过当层queue的size来进行迭代
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> levels = new ArrayList<List<Integer>>();
int level = 0;
Queue<TreeNode> queue = new LinkedList<>();
if(root == null) return levels;
queue.add(root);
int size;
TreeNode node;
while(!queue.isEmpty()) {
size = queue.size();
levels.add(new ArrayList<Integer>());
for(int i=0; i<size; i++) {
node = queue.poll();
levels.get(level).add(node.val);
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
level++;
}
return levels;
}
}