计算机应用基础数据结构部分试题及答案(2)(3)

C. (Front) - 1% (n = = rear D. (Front + 1)% (n = = rear

45.树中所有结点的度等于所有结点数加 ()

A.0 D.2. C. 1

46.在一棵树中, 每个结点最多有 个前驱结点 ().

A.0 B.1 C.2 d.任意多个

47.在一棵度为3的树中, 度为3的结点数为2个, 度为2的结点数为1个 度为1的结点点数为2个 则度为0的结点数为 个 (,,).

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

48.在一棵二叉树上第5层的结点数最多为 ()

A.16 B.15 C.8 D.32

49.在一棵具有n个结点的二叉树的第i层上, 最多具有 个结点 ().

A.2i 2I + 1 b. C. 2I D 2n - 1.

50.一颗具有35个结点的完全二叉树的深度为 ()

A.6 a D.8 B.7

41 - 45 B B D B C 46 - 50 c a b d

51.在一棵完全二叉树中, 若编号为i的结点存在右孩子, 则右孩子

结点的编号为 ()

A.2i b.2i-1 c.2i d.2i + 1 + 2

52.设高度为h的二叉树上只有度为0和度为2的结点, 则此类二叉树中所包含的结点数至少为 ()

A.2h b.2h-1 c.2h D.H + 1 + 1

53.按照二叉树的定义,

A two fork tree with 3 nodes; has () a state.

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

54. if the probability of finding each element is equal, the average search length of any element is found on the order table of length n

A.n, B.n+1, C. (n-1), /2, D. (n+1) /2

55., the sequential search method is suitable for storing linear tables with (linear) structure.

A. hash stores B., sequential storage, or link storage

C. compressed storage, D. index storage

56. for the sequential storage order table (5, 12, 20, 26, 37, 42, 46, 50, 64), if the use of binary search, find the search length (element 26)

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

57. on the linear scale bisearch, linear table (must)

A. is stored sequentially

B. is stored by link

C. is stored sequentially, and nodes are sorted in keyword order

D. is stored by linking, and nodes are sorted in keyword order

58. using a binary search method to find the length of a linear list is n, the average length of each element (for)

A., O (N2), B., O (nlogn), C., O (n), D., O (logn)

59. in the process of direct insertion of n elements, you need to go through ().

A,.N, B.n+1, C.n-1, D.2n

60. direct insertion of n elements, sorting time complexity is ()

A., O (1), B., O (N2), C., O (n), D., O (nlog2n)

51-55, C, B, A, D, B,, C, B, C, D, C

61. in the process of quick sorting of n elements, it is best

to do () a trip.

A., N, B., n/2, C., logn, D., 2n

62. in the process of bubbling n elements, you need at least () to complete.

A. 1, B., N, C., n-1, D., n/2

63., in the process of quick sorting of n elements, the average time complexity is

A., O (1), B., O (logn), C., O (N2), D., O (nlogn)

In the 64. sorting method, the method in which the elements in the sorted sequence are sequentially removed and compared to the elements in the sorted sequence (initially empty) is put into the correct position of the sorted sequence

A. insert sort B., bubble sort C., Hill sort, D. select sort

65. when sorting a linear table (25, 84, 21, 47, 15,, 27, 68, 35, 20), the sequence of elements changes as follows:

(1) 25, 84, 21, 47, 15,, 27, 68, 35, 20

(2) 20, 15, 21, 25, 47,, 27, 68, 35, 84

(3) 15, 20, 21, 25, 35,, 27, 47, 68, 84

(4) 15, 20, 21, 25, 27,, 35, 47, 68, 84

The sorting method used is ().

A. select sort, B., Hill sort, C. insert sort, D. quick sort

66. fast sorting of the following four sequences, each with the first element as the benchmark for the first division, then in the division process, the number of mobile elements required to have the largest number of sequences is ().

A. 1, 3, 5, 7, 9, B., 5, 7,, 9, 1, 3

C. 5, 3, 1, 7, 9, D., 9, 7,, 5, 3, 1

67., if a simple selection of n elements is sorted, the time complexity required to find the minimum element is the time required for any sort of sorting

A., O (1), B., O (logn), C., O (n), D., O (N2)

68., if the n elements are sorted by heap, a total (or) sieve operation is needed in the process of sorting each order by the initial heap.

A., n+1, B., n/2, C., N, D., n-1

In the 69. sorting method, the method of selecting elements in the sequence that never sorted and placing it in a sorted sequence (initially empty) is called ().

A., Hill sort, B. bubble sort, C. insert sort, D. select sort