Add Longest Subarray With Sum Less Than or Equal to K algorithm (#6042)

src/main/java/com/thealgorithms/datastructures/trees/BinaryTree.java

@@ -144,7 +144,7 @@ public class BinaryTree {
             if (temp == root) {
                 root = null;
             } // This if/else assigns the new node to be either the left or right child of the
-              // parent
+            // parent
             else if (temp.parent.data < temp.data) {
                 temp.parent.right = null;
             } else {