楼主:
Rushia (みけねこ的鼻屎)
2023-02-19 13:07:45103. Binary Tree Zigzag Level Order Traversal
给你一个树,找出Z字型走访的列表。
Example:
https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg
Input: root = [3,9,20,null,null,15,7]
Output: [[3],[20,9],[15,7]]
思路1:
1.BFS走访并把偶数层数的列表反转顺序。
Java Code: