--fix : suffix tree

Author: TheSTL

src/_DataStructures_/Trees/SuffixTree/index.js

@@ -1,3 +1,5 @@
+/* eslint-disable max-len */
+/* eslint-disable no-restricted-syntax */
 /* eslint-disable no-plusplus */
 /*
 Implemented by watching this conceptually video: https://www.youtube.com/watch?v=VA9m_l6LpwI
@@ -17,6 +19,7 @@ If found then return the index, else return -1
 
 */
 
+const alphabets = 'abcdefghijklmnopqrstuvwxyz';
 class Node {
   constructor(value, isEnd, index) {
     this.data = value;
@@ -41,7 +44,12 @@ class SuffixTree {
       let currentNode = this.head;
       while (j < currentString.length) {
         if (!currentNode.next.has(currentString[j])) {
-          currentNode.next.set(currentString[j], new Node(currentString, true, i));
+          let nextString = '';
+          while (j < currentString.length) {
+            nextString += currentString[j];
+            j++;
+          }
+          currentNode.next.set(nextString[0], new Node(nextString, true, i));
           break;
         } else {
           let k = 0;
@@ -60,9 +68,20 @@ class SuffixTree {
             diffString += partialMatchString[k];
             k++;
           }
+
           partialMatchNode.data = matchString;
           if (diffString) {
-            partialMatchNode.next.set(diffString[0], new Node(diffString, true, partialMatchNode.index));
+            const oldMap = partialMatchNode.next;
+            const newNode = new Node(diffString, partialMatchNode.isEnd, partialMatchNode.index);
+            const alphabetsArray = alphabets.split('');
+
+            for (const char of alphabetsArray) {
+              if (oldMap.has(char)) {
+                newNode.next.set(char, oldMap.get(char));
+              }
+            }
+            partialMatchNode.next = new Map();
+            partialMatchNode.next.set(diffString[0], newNode);
             partialMatchNode.isEnd = false;
             partialMatchNode.index = null;
           }
@@ -112,10 +131,17 @@ class SuffixTree {
   }
 }
 
-// const s = new SuffixTree('banana');
+// const st = 'asdjkxhcjbzdmnsjakdhasdbajw';
+// const s = new SuffixTree(st);
 // s.constructSuffixTree();
+// // console.log(s.head.next);
 
-//  console.log(s.findSubstring('nana'));
 
+// for (let i = 0; i < st.length; i++) {
+//   const e = st.substring(i);
+//   if (s.findSubstring(e) !== i) {
+//     console.log(e, i, s.findSubstring(e));
+//   }
+// }
 
 module.exports = SuffixTree;