using diamond-operator

= · haoel · commit 0b6e4c47412c · 2020-01-16T09:50:29.000+08:00
diff --git a/algorithms/java/src/binaryTreeBFSTraversal/binaryTreeBFSTraversalTest.java b/algorithms/java/src/binaryTreeBFSTraversal/binaryTreeBFSTraversalTest.java
@@ -41,13 +41,13 @@ public void testPreorderTraversal() throws Exception {
         n2.right = n6;
 
 
-        ArrayList<TreeNode> inputes = new ArrayList<TreeNode>();
+        ArrayList<TreeNode> inputes = new ArrayList<>();
         inputes.add(t0);
         inputes.add(n0);
 
         List<List<Integer>> results = new ArrayList<List<Integer>>(){{
             add(new ArrayList<Integer>(){{
-                   add(0);
+                add(0);
             }});
             add(new ArrayList<Integer>(){{
                 add(0);
