JAVA_LeetCode 103_Binary Tree Zigzag Level Order Traversal

JAVA_LeetCode 103_Binary Tree Zigzag Level Order Traversal 풀이 /** * 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 { public List zigzagLevelOrder(TreeNode root) { // queue와 방향에 맞춰 리스트를 노드로 넣어준다. List list = new Arra...