/**
* 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>> zigzagLevelOrder(TreeNode root) {
//建立结果数组
List<List<Integer>> ans = new ArrayList<>();
if(root == null){
return ans;
}
//建立队列
Queue<TreeNode> q = new LinkedList<>();
//将根节点放入队列
q.add(root);
int cnt = 0;
//队列不为空时
while(!q.isEmpty()){
List<Integer> tem = new ArrayList<>();
int size = q.size();
for(int i = 0;i<size;i++){
TreeNode cur = q.poll();
if(cur == null) continue;
if(cnt%2==0){
tem.add(cur.val);
}
else{
tem.add(0,cur.val);
}
q.add(cur.left);
q.add(cur.right);
}
cnt++;
if(!tem.isEmpty()){
ans.add(tem);
}
}
return ans;
}
}
