层级遍历,基本功,当中能不能不要再犯一个总是忽略的问题!!!!
看清楚好不好
List<Integer> list = new LinkedList<>();
//list.add(node);
list.add(node.val);
/**
* 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>> results = new LinkedList<>();
if (root == null) {
return results;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
List<Integer> list = new LinkedList<>();
int length = queue.size();
for (int i = 0; i < length; i++) {
TreeNode node = queue.poll();
//list.add(node);
list.add(node.val);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
results.add(list);
}
return results;
}
}