Q261
What is the average case time complexity for finding the height of the binary tree?
A.
h = O(loglogn)
B.
h = O(nlogn)
C.
h = O(n)
D.
h = O(log n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board