cchavcchav3914 cchavcchav3914 15-01-2024 Computers and Technology contestada The efficiency of a lookup into an ideally balanced binary tree is big-O of: a) O(n) b) O(log n) c) O(n log n) d) O(1)