+1 vote
in Data Structures & Algorithms I by (88.2k points)
The average depth of a binary tree is given as?

(a) O(N)

(b) O(log N)

(c) O(M log N)

(d) O(√N)

This question is from Trees topic in section Trees of Data Structures & Algorithms I

This question was posed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (d) O(√N)

The best I can explain: The average depth of a binary expression tree is mathematically found to be O(√N).

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.