一个深度为h的满k叉树,最多有多少个叶结点?(独根树深度为0)(单选) There is a full k-ary tree, whose depth is h. How many leaf nodes can it have at most? (The depth of a tree, which only has a root node, is 0.)(There is only one correct answer) A、 B、 C、 D、 点击查...