The worst-case running time of the Search (or Insert) operation in a binary search tree containing n keys is? 2. B. ?(log n) C. ?(height) D. 0(n) 3. The worst-case running time of the Max operation in a binary search tree containing n keys is? B. ?(log n) C. ?(height) D. ?(n)