题目内容

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

查看答案

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

更多问题

16 It is known that the infix form of an arithmetic expression is A+BC-D/E, the suffix form is ABC+DE/-, and its prefix form is ( ).

A. -A+B*C/DE
B. -A+B*CD/E
C. -+*ABC/DE

查看答案

17 If an undirected graph with n nodes and k edges is a forest (n>k), then there must be ( ) trees in the forest.

A. n-k
B. k
C. n
D. n+k

查看答案

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

查看答案

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

16 It is known that the infix form of an arithmetic expression is A+B*C-D/E, the suffix form is ABC*+DE/-, and its prefix form is ( ).

17 If an undirected graph with n nodes and k edges is a forest (n>k), then there must be ( ) trees in the forest.

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

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

A. 12
B. 10
C. 11
D. 13

16 It is known that the infix form of an arithmetic expression is A+BC-D/E, the suffix form is ABC+DE/-, and its prefix form is ( ).