Merge branch 'master' into master

chinaeva · May 29, 2019 · ffee5d0 · ffee5d0
2 parents 9ed26d2 + 03a8b84
commit ffee5d0
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/com/williamfiset/datastructures/balancedtree/AVLTreeRecursive.java b/com/williamfiset/datastructures/balancedtree/AVLTreeRecursive.java
@@ -266,7 +266,7 @@ private Node remove(Node node, T elem) {
       // successor of the node being removed can either be the largest
       // value in the left subtree or the smallest value in the right 
       // subtree. As a heuristic, I will remove from the subtree with
-      // the most nodes in hopes that this may help with balancing.
+      // the greatest hieght in hopes that this may help with balancing.
       } else {
 
         // Choose to remove from left subtree

diff --git a/com/williamfiset/datastructures/suffixarray/SuffixArray.java b/com/williamfiset/datastructures/suffixarray/SuffixArray.java
@@ -47,14 +47,14 @@ public int[] getLcpArray() {
   }
 
   // Builds the suffix array by calling the construct() method.
-  private void buildSuffixArray() {
+  protected void buildSuffixArray() {
     if (constructedSa) return;
     construct();
     constructedSa = true;
   }
 
   // Builds the LCP array by first creating the SA and then running the kasai algorithm.
-  private void buildLcpArray() {
+  protected void buildLcpArray() {
     if (constructedLcpArray) return;
     buildSuffixArray();
     kasai();