+1 vote
in Data Structures & Algorithms I by (110k points)
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)

My question is based upon Binary Tree Properties topic in chapter Binary Trees of Data Structures & Algorithms I

I have been asked this question at a job interview.

1 Answer

+1 vote
by (786k points)
selected by
Best answer
Right answer is (d) h = O(log n)

The explanation is: 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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Most popular tags

biology – class 12 biology – class 11 construction & building materials chemistry – class 12 electronic devices & circuits network theory data structures & algorithms ii cell biology computational fluid dynamics engineering physics i discrete mathematics chemistry – class 11 aerodynamics casting-forming-welding i engineering mathematics operating system casting-forming-welding ii engineering drawing mysql engineering geology digital circuits wireless mobile energy management electrical measurements digital communications cyber security analytical instrumentation embedded systems electric drives computer fundamentals basic civil engineering advanced machining iot design of electrical machines physics – class 12 applied chemistry dairy engineering basic chemical engineering cloud computing cytogenetics bioinformatics aircraft design aircraft maintenance software engineering drug biotechnology digital signal processing biochemistry data structures & algorithms i automotive engine design avionics engineering material & metallurgy energy engineering cognitive radio unix electrical machines biomedical instrumentation object oriented programming electromagnetic theory analog communications bioprocess engineering civil engineering drawing engineering metrology physics – class 11 mathematics – class 12 engineering chemistry i basic electrical engineering unit processes mongodb cryptograph & network security hadoop mathematics – class 11 engineering physics ii html control systems engineering mechanics antennas analog circuits computer network java sql server javascript concrete technology chemical process calculation artificial intelligence design of steel structures c++ database management computer architecture engineering chemistry ii corrosion engineering chemical technology dc machines automata theory digital image processing r programming matlab rdbms compiler aircraft performance aerospace materials & processes