题目内容

18 A and B are two nodes on a binary tree. In the in-order traversal, the condition for A before B is ( ).

A is to the left of B
B. A is to the right of B
C. A is the ancestor of B
D. A is a descendant of B

查看答案

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

更多问题

19 After converting a tree into a binary tree, the shape of the binary tree is ( ).

A. Only
B. There are many
C. There are many, but none of the root nodes have left children
D. There are many, but none of the root nodes have right children

查看答案

20 Which of the following statements is correct ().

A. There are at most two subtrees in a binary tree, and there are left and right subtrees
B. A binary tree is an ordered tree of degree 2
C. There is no left-right distinction when the node has only one child in a binary tree.
D. There must be a node of degree 2 in the binary tree

查看答案

21 There are altogether ( ) binary trees with 7 nodes, and they are not similar to each other.

A. 429
B. 428
C. 427
D. 426

查看答案

22 In the Huffman tree, if the encoding length is only allowed to be less than or equal to 4, in addition to the determined encodings of two characters as 0 and 10, at most ( ) characters can be encoded.

A. 4
B. 3
C. 5
D. 6

查看答案

18 A and B are two nodes on a binary tree. In the in-order traversal, the condition for A before B is ( ).

A is to the left of B B. A is to the right of B C. A is the ancestor of B D. A is a descendant of B

19 After converting a tree into a binary tree, the shape of the binary tree is ( ).

20 Which of the following statements is correct ().

21 There are altogether ( ) binary trees with 7 nodes, and they are not similar to each other.

22 In the Huffman tree, if the encoding length is only allowed to be less than or equal to 4, in addition to the determined encodings of two characters as 0 and 10, at most ( ) characters can be encoded.

A is to the left of B
B. A is to the right of B
C. A is the ancestor of B
D. A is a descendant of B