Minimum in a Binary Tree

Computer Science Level 2

image image

Suppose we implement an algorithm to find the minimum element in a binary search tree with n n nodes. Which of the following is a conceivable complexity for the algorithm?

O ( lg ⁡ ( lg ⁡ ( n ) ) ) O(\lg(\lg(n) ) ) O ( 1 ) O(1) O ( lg ⁡ ( n ) ) O(\lg(n)) O ( lg ⁡ ( n ) ) O\left(\sqrt{\lg(n)}\right)

Thaddeus Abiy by Thaddeus Abiy , 25, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Hasmik Garyaka
Sep 25, 2017

T ( 2 n ) = n T(2^n)=n so it is binary logarythm

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...