public List<List<Integer>> levelOrder(TreeNode root) {
List<List<Integer>> out = new LinkedList<>();
if (root == null) return out;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
int num = 0;
while (!queue.isEmpty()) {
int size = queue.size();
List<Integer> out1 = new LinkedList<>();
for(int i = 0; i < size; i++) {
TreeNode node = queue.poll();
if (num % 2 == 1) {
out1.add(node.val);
}
else {
out1.add(0,node.val);
}
if (node.right != null) {
queue.add(node.right);
}
if (node.left != null) {
queue.add(node.left);
}
}
num++;
if (!out1.isEmpty()) {
out.add(out1);
}
}
return out;
}
从上到下打印二叉树 III
最新推荐文章于 2022-07-04 20:39:02 发布