2,121 views

1 Answer

0 votes
0 votes

C option...

Related questions

0 votes
0 votes
1 answer
1
monali asked Jan 11, 2016
795 views
1 votes
1 votes
0 answers
3
Rohit Gupta 8 asked Dec 25, 2017
1,136 views
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$