题目内容

29 Assume that F is a forest, made up of tree T1, T2, T3, and the number of nodes in T1, T2, T3 are n1, n2, n3 respectively. If the binary tree corresponding to F is B, there are ( ) nodes in the right subtree of B.

A. n2
B. n3
C. n1+n3
D. n2+n3

查看答案

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

更多问题

30 Assume that F is a forest, made up of tree T1, T2, T3, and the node numbers of T1, T2, T3 are n1, n2, n3 respectively. If the binary tree corresponding to F is B, there are ( ) nodes in the left subtree of B.

A. n2-1
B. n3-1
C. n1-1
D. n2

31 Transform a tree T into a binary tree B, Then the post-order traversal sequence of T is the same as the ( ) sequence of B.

A. preorder traversal
B. postorder traversal
C. inorder traversal
D. level traversal

32 If a complete 3-ary tree is stored sequentially in a one-dimensional array(subscript starts from 0). Then which level is the node with subscript 121 at?

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

33 If a complete 3-ary tree is stored sequentially in a one-dimensional array(subscript starts from 0). Then which level is the node with subscript 120 at?

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