+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

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.