refactor 102

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_102.java

@@ -7,27 +7,6 @@
 import java.util.List;
 import java.util.Queue;
 
-/**
- * 102. Binary Tree Level Order Traversal
- *
- * Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
- *
- * For example:
- * Given binary tree [3,9,20,null,null,15,7],
- *    3
- *   / \
- *  9  20
- *    /  \
- *   15   7
- *
- * return its level order traversal as:
- *
- * [
- * [3],
- * [9,20],
- * [15,7]
- * ]
- */
 public class _102 {
 
     public static class Solution1 {