refactor 102

Author: fishercoder1534

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

@@ -7,7 +7,8 @@
 import java.util.List;
 import java.util.Queue;
 
-/**102. Binary Tree Level Order Traversal
+/**
+ * 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).
 
@@ -29,23 +30,24 @@
 ]
 */
 public class _102 {
+
 	public List<List<Integer>> levelOrder(TreeNode root) {
-		List<List<Integer>> result = new ArrayList<List<Integer>>();
-		if(root == null) return result;
-		
-		Queue<TreeNode> q = new LinkedList<TreeNode>();
+		List<List<Integer>> result = new ArrayList<>();
+		if (root == null) return result;
+		Queue<TreeNode> q = new LinkedList();
 		q.offer(root);
-		while(!q.isEmpty()){
-			List<Integer> thisLevel = new ArrayList<Integer>();
+		while (!q.isEmpty()) {
+			List<Integer> thisLevel = new ArrayList();
 			int qSize = q.size();
-			for(int i = 0; i < qSize; i++){
+			for (int i = 0; i < qSize; i++) {
 				TreeNode curr = q.poll();
 				thisLevel.add(curr.val);
-				if(curr.left != null) q.offer(curr.left);
-				if(curr.right != null) q.offer(curr.right);
+				if (curr.left != null) q.offer(curr.left);
+				if (curr.right != null) q.offer(curr.right);
 			}
 			result.add(thisLevel);
 		}
 		return result;
 	}
+
 }