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

Category: QuestionsWhat is the upper bound for maximum leaves in K-ary tree with height h?
Editor">Editor Staff asked 1 month 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.

1 Answers
Editor">Editor Staff answered 1 month 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.