refactor Node

fishercoder1534 · fishercoder1534 · commit 616a7e5338fd · 2020-10-20T06:41:39.000-07:00
diff --git a/src/main/java/com/fishercoder/common/classes/Node.java b/src/main/java/com/fishercoder/common/classes/Node.java
@@ -4,25 +4,28 @@
 import java.util.List;
 
 public class Node {
-  public int val;
-  public List<Node> children;
+    public int val;
+    public List<Node> children;
 
-  public Node() {
-  }
+    public Node() {
+    }
 
-  public Node(int val, List<Node> children) {
-    this.val = val;
-    this.children = children;
-  }
+    public Node(int val, List<Node> children) {
+        this.val = val;
+        this.children = children;
+    }
 
-  public Node(int val) {
-    this.val = val;
-    this.children = new ArrayList<>();
-  }
+    public Node(int val) {
+        this.val = val;
+        this.children = new ArrayList<>();
+    }
 
-  //todo: implement this method
-  /**return a N-ary tree based on the preorder values*/
-  public static Node createNaryTree(List<Integer> preorderValues) {
-    return null;
-  }
+    //todo: implement this method
+
+    /**
+     * return a N-ary tree based on the preorder values
+     */
+    public static Node createNaryTree(List<Integer> preorderValues) {
+        return null;
+    }
 }
