0 votes
in Data Structures & Algorithms I by (110k points)
The average depth of a binary tree is given as?

(a) O(N)

(b) O(√N)

(c) O(N^2)

(d) O(log N)

My query is from Binary Trees topic in chapter Binary Trees of Data Structures & Algorithms I

The question was asked in semester exam.

1 Answer

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

The best I can explain: The average depth of a binary tree is given as O(√N). In case of a binary search tree, it is O(log 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.

Categories

...