DerikF4726 DerikF4726 28-12-2023 Computers and Technology contestada What is the worst case for finding a given key in a Binary Search Tree (BST)? 1) O(1) 2) O(n) 3) O(log n) 4) O(n log n)
