/**
* 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>> lists=new ArrayList<List<Integer>>();
if(root==null)return lists;
Queue<TreeNode> queue=new LinkedList<TreeNode>();
queue.offer(root);
boolean flag=false;
while(!queue.isEmpty()){
List<Integer> list=new ArrayList<Integer>();
int size=queue.size();
for(int i=0;i<size;i++){
TreeNode temp=queue.poll();
list.add(temp.val);
if(temp.left!=null)queue.offer(temp.left);
if(temp.right!=null)queue.offer(temp.right);
}
if(flag) Collections.reverse(list);
lists.add(list);
flag=!flag;
}
return lists;
}
}
[leetcode]103. Binary Tree Zigzag Level Order Traversal
最新推荐文章于 2022-07-29 16:59:42 发布