树及二叉树图（Tree and two tree diagram）.docVIP

树及二叉树图（Tree and two tree diagram） Sixth chapter tree and two branch tree First, the multiple-choice question The 1. known arithmetic expression infix form A+B*C-D/E, form ABC*+DE/- suffix, the prefix form (for) A.-A+B*C/DE, B., -A+B*CD/E, C.-+*ABC/DE, D., -+A*BC/DE 2. the arithmetic expression a+b* (c+d/e) is converted to a postfix expression (()) A.ab+cde/* B.abcde/+*+ C.abcde/*++ D.abcde*/++ 4. the tree T has a degree of 4, in which the number of nodes is 1, 2, 3 and 4, respectively, 4, 2, 1, and 1, and the number of leaves in T is () A.5 B.6 C.7 D.8 5. in the following conclusions, what is correct is () (1) the degree of the two branch tree with only one node is 0; the degree of the two fork tree is 2; and the left and right subtree of the two fork tree can be exchanged at will; A full two fork tree with a depth of K and less than or equal to the same number of nodes of a full two fork tree. A., II. B., II. C., II. D. 6. set the forest F corresponding two fork tree is B, it has m nodes, B root is p, P right subtree node number is n, forest F in the first tree the number of nodes is () A.m-n B.m-n-1 C.n+1 D. condition is insufficient, cannot determine The 7. tree is a finite set of nodes, and it ((1)) is the root node, denoted as T. The remaining nodes are divided into sets of M (m0) and ((2)) T1, T2,... Tm, each collection is a tree, The T node called Ti parent node, Ti called T nodes (1 I m). The number of nodes of a node is called that of the node ((3)). Two forks, trees, and trees are two different concepts, The two branch tree is also a finite set of nodes, and it ((4)) is the root node. (1) (4) A. has 0 or 1 B., there are 0 or more C., there is only one D., and there are 1 or more than 1 (2) A. disjoint B. allows intersection C., allowing leaf nodes to intersect, and D. allows branch nodes to intersect (3) A. weight, B. dimension, C. Number of times D. order 8. if a tree with two branches has 10 degrees of 2 nodes, 5 degrees of 1 nodes, then the degree of 0