What is the time complexity for searching k+1 auxiliary trees?

• A. k+2 O (log (log n))
• B. k+1 O (log n)
• C. K+2 O (log n)
• D. k+1 O (log (log n))