What is the average case time complexity for finding the height of the binary tree?
Posted: Wed Jul 13, 2022 7:42 pm
a) h = O(loglogn)
b) h = O(nlogn)
c) h = O(n)
d) h = O(log n)
b) h = O(nlogn)
c) h = O(n)
d) h = O(log n)
Accurate answers. Every time.
https://answerhappy.com/