What is the upper bound for maximum leaves in K-ary tree with height h?

› Category: Questions › What is the upper bound for maximum leaves in K-ary tree with height h?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

What is the upper bound for maximum leaves in K-ary tree with height h?
 
(a) K*h
 
(b) K^h
 
(c) K+h
 
(d) K-h
 
Query is from K-ary Tree topic in portion Trees of Data Structures & Algorithms I
 
I have been asked this question during an interview for a job.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Correct answer is (b) K^h
 
The best explanation: In the K-ary tree having height h, the upper bound for having maximum number of leaves is k^h.


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: 40702

Related Posts