题目内容

11 A Huffman tree has a total of 215 nodes, and Huffman coding can get a total of ( ) different codewords.

A. 107
B. 108
C. 214
D. 215

查看答案

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

更多问题

12 A binary tree with N nodes is stored in a binary linked list, and there are ( ) null pointer fields.

A. N+1
B. N
C. N-1
D. Unconfirmed

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