Vidyalelo
Data Structure · Q124

Trees in Data Structures

Programming · Data Structure · question 124

Q124

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

A.
K*h
B.
K^h
Answer
C.
K+h
D.
K-h

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board