👉 In computer science and mathematics, a "searchant" is a type of object that has a constant time complexity for searching an element in a sorted array. This means that the search operation takes a fixed amount of time regardless of the size of the array or the number of elements it contains. For example, consider a binary search tree where each node has two children (left and right). If we want to find the value at a given index in this tree, we can perform a linear search on
