The average depth of a binary tree is given as?

Category: QuestionsThe average depth of a binary tree is given as?
Editor">Editor Staff asked 4 weeks ago

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 Answers
Editor">Editor Staff answered 4 weeks ago

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).