refactor 103

fishercoder1534 · fishercoder1534 · commit e27fd2067a49 · 2020-05-09T10:14:46.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_103.java b/src/main/java/com/fishercoder/solutions/_103.java
@@ -8,26 +8,6 @@
 import java.util.List;
 import java.util.Queue;
 
-/**
- * 103. Binary Tree Zigzag Level Order Traversal
- *
-Given a binary tree, return the zigzag level order traversal of its nodes' values.
- (ie, from left to right, then right to left for the next level and alternate between).
-
-For example:
-Given binary tree [3,9,20,null,null,15,7],
-    3
-   / \
-  9  20
-    /  \
-   15   7
-return its zigzag level order traversal as:
-[
-  [3],
-  [20,9],
-  [15,7]
-]
-*/
 public class _103 {
     public static class Solution1 {
         public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
