From b4b96953f6ac9e7b0f2951ada41cca68a0985cfb Mon Sep 17 00:00:00 2001 From: khanhkhanhlele Date: Wed, 5 Nov 2025 18:58:00 +0700 Subject: [PATCH] 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 214e111b9f1a..fff84111663b 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 @@ * * 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 @@ * 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