Micheale4786 Micheale4786 28-12-2023 Computers and Technology contestada What is the worst case for an algorithm to return all keys that are greater than 20 and that are multiples of 3 in a Binary Search Tree (BST)? 1) O(log n) 2) O(n) 3) O(n log n) 4) O(n²)
