103. 二叉树的锯齿形层序遍历
难度:中等
给定一个二叉树,返回其节点值的锯齿形层序遍历。(即先从左往右,再从右往左进行下一层遍历,以此类推,层与层之间交替进行)。
例如:
给定二叉树 [3,9,20,null,null,15,7]
,
3
/ \
9 20
/ \
15 7
返回锯齿形层序遍历如下:
[
[3],
[20,9],
[15,7]
]
解答:
/**
* 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;
* }
* }
*/
class Solution {
//BFS
//时间复杂度O(N)。空间复杂度O(N)
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> ans = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if(root != null) queue.offer(root);
while(!queue.isEmpty()){
int size = queue.size();
List<Integer> tempList = new ArrayList<>();
for(int i = 0; i < size; i++){
TreeNode tempRoot = queue.poll();
tempList.add(tempRoot.val);
if(tempRoot.left != null) queue.offer(tempRoot.left);
if(tempRoot.right != null) queue.offer(tempRoot.right);
}
if(ans.size() % 2 == 1) Collections.reverse(tempList);
ans.add(tempList);
}
return ans;
}
}
参考自:
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/solution/1ms-98er-cha-shu-ceng-xu-bian-li-mo-ban-d8itp/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。