6 Construct a Huffman tree from 4 leaf nodes with weights of 9, 2, 5 and 7, then the weighted path length of the tree is ().
查看答案
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