/**
* 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) {
LinkedList<List<Integer>> list = new LinkedList<>();
Queue<TreeNode> stack = new LinkedList<>();
if (root != null) {
stack.add(root);
}
while (!stack.isEmpty()) {
int size = stack.size();
LinkedList<Integer> temp = new LinkedList<>();
while (size-- > 0) {
TreeNode res = stack.poll();
if (list.size() % 2 == 0) {
temp.addLast(res.val);
} else {
temp.addFirst(res.val);
}
if (res.left != null) {
stack.add(res.left);
}
if (res.right != null) {
stack.add(res.right);
}
}
list.add(temp);
}
return list;
}
}
剑指 Offer 32 - III. 从上到下打印二叉树 III
最新推荐文章于 2022-03-22 13:59:24 发布