From c7cb54ed84f98e0d130caf3b4335c9eed69101d3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?L=C3=AA=20Nam=20Kh=C3=A1nh?=
<55955273+khanhkhanhlele@users.noreply.github.com>
Date: Wed, 5 Nov 2025 22:49:00 +0700
Subject: [PATCH] chore: fix typos in
src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
(#7048)
Fix typos in src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
---
.../datastructures/trees/CeilInBinarySearchTree.java | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java b/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
index 214e111b9..fff841116 100644
--- a/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
+++ b/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
@@ -21,7 +21,7 @@ import com.thealgorithms.datastructures.trees.BinaryTree.Node;
*
* Solution 1: Brute Force Solution: Do an inorder traversal and save result
* into an array. Iterate over the array to get an element equal to or greater
- * than current key. Time Complexity: O(n) Space Complexity: O(n) for auxillary
+ * than current key. Time Complexity: O(n) Space Complexity: O(n) for auxiliary
* array to save inorder representation of tree.
*
*
@@ -29,7 +29,7 @@ import com.thealgorithms.datastructures.trees.BinaryTree.Node;
* into an array.Since array is sorted do a binary search over the array to get
* an element equal to or greater than current key. Time Complexity: O(n) for
* traversal of tree and O(lg(n)) for binary search in array. Total = O(n) Space
- * Complexity: O(n) for auxillary array to save inorder representation of tree.
+ * Complexity: O(n) for auxiliary array to save inorder representation of tree.
*
*
* Solution 3: Optimal We can do a DFS search on given tree in following