题目内容

27 A full k-ary tree with depth h has at most ( ) nodes.

A. k^(h-1)
B. k^h
C. (k^(h-1)-1)/(k-1)
D. (k^h-1)/(k-1)

查看答案

搜索结果不匹配？点我反馈

更多问题

28 If a forest has N vertices and K branches（N>K and 2K>=N）, then the forest has ( ) trees.

A. N-K
B. N-K+1
C. N-K/2
D. N-K/2+1

29 Assume that F is a forest, made up of tree T1, T2, T3, and the number of nodes in T1, T2, T3 are n1, n2, n3 respectively. If the binary tree corresponding to F is B, there are ( ) nodes in the right subtree of B.

A. n2
B. n3
C. n1+n3
D. n2+n3

30 Assume that F is a forest, made up of tree T1, T2, T3, and the node numbers of T1, T2, T3 are n1, n2, n3 respectively. If the binary tree corresponding to F is B, there are ( ) nodes in the left subtree of B.

A. n2-1
B. n3-1
C. n1-1
D. n2

31 Transform a tree T into a binary tree B, Then the post-order traversal sequence of T is the same as the ( ) sequence of B.

A. preorder traversal
B. postorder traversal
C. inorder traversal
D. level traversal