Answer to Question #23180 in Quantitative Methods for Sujata Roy
A k-ary tree is a tree in which every node has at most k children. In a k-ary tree with n nodes and height h,which of the following is an upper bound for the maximum number of leaves as a function of h, k,and n ?
(A) logk n
(B) logk h