Question

What is the time complexity for finding the height of the binary tree?
O a) h= O(loglogn)
. b) 1 = 0 log)
c) h= O(n)
d) h=O(log n)​

Answer 1

Answer:

the answer is (h= O) so this is the answer