class Node_Tree {
  constructor(val) {
    this.val = val;
    this.parent = null;
    this.children = [];
  }
}

class Node_Trie {
  constructor(val) {
    /*
    ** The node stores a single character as its value.
    ** Child nodes are stored in an object instead of an array for constant-time lookup
    ** because every child node will have a unique value/letter
    */
    this.val = val;
    this.children = {};
  }
}

class Node_BST {
  constructor(key, val) {
    /*
    ** Key should be an integer, for proper placement of the node in a Binary Search Tree
    */
    this.key    = key;
    this.val    = val;
    this.parent = null;
    this.left   = null;
    this.right  = null;
  }
}


export { Node_Tree, Node_Trie, Node_BST };
@@ -691,16 +691,266 @@
 %0A  %7D%0A%7D%0A%0A
+class Node_LinkedList %7B%0A  constructor(val) %7B%0A    /*%0A    ** A block of information stored in a doubly linked list.%0A    ** Stores references to the next and previous nodes.%0A    */%0A    this.val  = val;%0A    this.next = null;%0A    this.prev = null;%0A  %7D%0A%7D%0A%0A
 %0Aexport 

Add linked list node to utils