What is the average case time complexity for finding the height of the binary tree?

What is the average case time complexity for finding the height of the binary tree? Correct Answer h = O(log n)

The nodes are either a part of left sub tree or the right sub tree, so we don’t have to traverse all the nodes, this means the complexity is lesser than n, in the average case, assuming the nodes are spread evenly, the time complexity becomes O(logn).
Bissoy MCQ

Related Questions

There is a tree between houses of A and B. If the tree leans on A’s House, the tree top rests on his window which is 12 m from ground. If the tree leans on B’s House, the tree top rests on his window which is 9 m from ground. If the height of the tree is 15 m, what is distance between A’s and B’s house?
Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
Average of the height of 251 students of a school is 48. If the average of the height of the boys is 51 and the average of the height of the girls is 29, then what will be the ratio of the total height of boys and the total height of girls respectively?
The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.
The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.
Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.
The popular notion that a tree's age can be determined by counting number of internal rings in its trunk is generally true. Howeevr, to help regulate the internal temperature of the tree, the outermost layers of wood of the Brazilian ash often →peel away when the temperature exceeds 95 degrees Fahrenheit, leaving the tree with fewer rings than it would otherwise have. So only if the temperature in the Brazilian ash's environment never exceeds 95 degrees Fahrenheit →elav eing the tree with fewer rings than it would otherwise have. So only if the reliable measure of the tree's age. Which of the following is an assumption on whish the argument above depends?
A tree is cut partially and made to fall on ground. The tree however does not fall completely and is still attached to its cut part. The tree top touches the ground at a point 10m from foot of the tree making an angle of 30°. What is the length of the tree?
Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as