The average depth of a binary tree is given as?

› Category: Questions › The average depth of a binary tree is given as?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months 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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months 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).


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts