题目内容

7 Let T be a Huffman tree with 8 leaf nodes, then the highest height of T can be ()

A. 4
B. 6
C. 8
D. 10

查看答案

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

更多问题

8 Which of the following is a prefix code? ( )

A. {0,1101,1110,1100,1111}
B. {0,1,01,010,110}
C. {00,01,10,11,101}
D. {01,00,10,001,110,101}

9 The postfix expression of the arithmetic expression a+b* (c+d/e) is ( ).

A. abcde/+*+
B. ab+cde/*
C. abcde/*++
D. abcde*/++

10 Suppose the degree of tree T is 4, where the number of nodes with degrees 1, 2, 3 and 4 are 4, 2, 1, 1, respectively, then the number of leaves in T is ().

A. 5
B. 6
C. 7
D. 8

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