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
Answer: Option B
This Question Belongs to Data Structure >> Trees In Data Structures
Related Questions on Trees in Data Structures
A. Inorder
B. Preorder
C. Postorder
D. Level-order
Join The Discussion