/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
/**
* BFS
* https://leetcode.com/submissions/detail/337325186/
*/
class Solution {
public List> zigzagLevelOrder(TreeNode root) {
List> result = new ArrayList<>();
if (root == null) {
return result;
}
Queue queue = new LinkedList<>();
queue.offer(root);
boolean inverse = false;
while (!queue.isEmpty()) {
List list = new LinkedList<>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
if (inverse) {
list.add(0, node.val);
} else {
list.add(node.val);
}
TreeNode left = node.left;
if (left != null) {
queue.add(left);
}
TreeNode right = node.right;
if (right != null) {
queue.add(right);
}
}
inverse = !inverse;
result.add(list);
}
return result;
}
}
一键复制
编辑
Web IDE
原始数据
按行查看
历史