What is the 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)