题目内容

13 The total number of nodes in the binary tree with depth K ().

A. ≤ 2^k-1
B. < 2^k-1
C. ≤2^k

查看答案

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

更多问题

14 A Huffman tree constructed with the data set {4,5,6,7,10,12,18} as the leaf node weights, and its weighted path length is ().

A. 155
B. 160
C. 165
D. 170

15 A tree with 3 degrees has 2 nodes with 1 degree, 3 nodes with 2 degrees and 4 nodes with 3 degrees, so it has ( ) leaf nodes.

A. 12
B. 10
C. 11
D. 13

16 It is known that the infix form of an arithmetic expression is A+BC-D/E, the suffix form is ABC+DE/-, and its prefix form is ( ).

A. -A+B*C/DE
B. -A+B*CD/E
C. -+*ABC/DE

17 If an undirected graph with n nodes and k edges is a forest (n>k), then there must be ( ) trees in the forest.

A. n-k
B. k
C. n
D. n+k