algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-12-19 07:00:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

chore: fix typos in src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java (#7048)

Browse Source 
Fix typos in src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
This commit is contained in:
Lê Nam Khánh
2025-11-05 22:49:00 +07:00
committed by GitHub
parent 147da38888
commit c7cb54ed84
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java
View File

@@ -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.
* <p>
* <p>
@@ -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.
* <p>
* <p>
* Solution 3: Optimal We can do a DFS search on given tree in following