题目内容

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

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

答案查题题库