add space time complexity

Author: betomoedano

binary-trees/list-of-depths.js

@@ -3,6 +3,8 @@ const LinkedList = require("../utils/LinkedList");
  * Given a binary tree design an algorithm wich creates
  * a linked list of all the nodes at each depth (e.g., if you
  * have a tree with depth D, you'll have D linked lists).
+ * Time O(n)
+ * Space O(n)
  */
 
 class Node {

utils/LinkedList.js

@@ -0,0 +1,17 @@
+class LinkedList {
+  constructor(value) {
+    this.value = value;
+    this.next = null;
+  }
+
+  add(value) {
+    let currentNode = this;
+
+    while (currentNode !== null) {
+      currentNode = currentNode.next;
+    }
+    currentNode.next = new LinkedList(value);
+  }
+}
+
+module.exports = LinkedList;