catboy3095 catboy3095 28-12-2023 Computers and Technology contestada What is the worst case for an algorithm to find the smallest key that is within a fixed distance d from a given key in a Binary Search Tree (BST)? 1) O(d) 2) O(log n) 3) O(n) 4) O(nlog n) 5) It cannot be determined
