in Algorithms retagged by
1,497 views
1 vote
1 vote

in Algorithms retagged by
1.5k views

1 Answer

0 votes
0 votes

Ans = C option.

 

O(logn) because in worst case the height of recursive tree is logn levels!

Related questions

4 votes
4 votes
1 answer
3