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

Category: QuestionsWhat is the time complexity for searching k+1 auxiliary trees?
Editor">Editor Staff asked 5 months ago

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))

I’d like to ask this question from Binary Trees topic in division Binary Trees of Data Structures & Algorithms I

Editor">Editor Staff answered 5 months ago

The correct option is (d) k+1 O (log (log n))

The best I can explain: Since each search operation in the auxiliary tree takes O (log (log n)) time as auxiliary tree size is bounded by the height of the reference tree that is log n. So for k+1 auxiliary trees, total search time is k+1 O (log (log n)).

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40702