一、题目
力扣原题:https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/
二、BFS搜索
/**
* 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) {
if (null == root) {
return new ArrayList<>();
}
// 保存最终结果
List<List<Integer>> result = new ArrayList<>();
// 保存下一层的节点
List<TreeNode> records = new ArrayList<>();
records.add(root);
// 1 = 向右,2 = 向左
int direction = 1;
while (!records.isEmpty()) {
// 记录一层结果
List<Integer> subResult = new