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

35. assuming a two binary tree sequence stored in

one-dimensional array a, but let the number 1 of the nodes in the a[0] element, so that the number 2 of the nodes in the a[1] element, the other is analogy, numbered I nodes of the left child node corresponding to the array index ______, corresponding to the right child ______.

36., a n node of the two tree completely from the root node of this layer, each layer of the node from left to right in the order of storage in the array A[1

N], set up a node position in the array of I (1 i n), his father is the position of the nodes is _______.

37. of the two fork tree depth is h, and only 0 degrees and 2 nodes, the two tree contains nodes up to _______.

38. assume a set of records (46,79,56,38,40,84), in the process of bubble sort to sort the results for the first time _______.

39. assume a set of records (46,79,56,38,40,80), the process of quick sort, a total of ______ times ranking.

40. assume a set of records (46,79,56,38,40,80), with its quick sort, it is the first time after the division of the ______.

31.2k-1, 2k-1, 2k-1

Thirty-two point five 33.n-1

Thirty-four point six

35.2i-1, 2I

36.[i/2] (take integer part) 37.2h-1

38.46,56,38,40,79,84

Thirty-nine point three

40.[40,38], 46, [56,79,80]

41. of n records in the ordered list of binary search, compare the number of the largest is ______.

The storage structure of 42. binary search method is limited to ______, and orderly.

43. in a single list, to delete a specified node, the node must

find ______.

Four kinds of the basic operation of the linear table 44. are inserted and deleted, search and ______ operation.

45. circular single linked list and main different non circular single linked list is circular single linked list tail pointer ______, rather than circular single linked list tail pointer ______.

46. access to single node in the linked list, must be followed along ______.

47. in the double linked list, each node has two pointers, one point to another point ______ ______.

48. in a doubly linked list, delete the pointer points to the P node, the need for p->next->prior domain pointer assignment for ______.

49. let head be a circular linked list L head node, the L is empty table is ______.

50. stack called ______ queue table, also known as ______ table. 41.log2n

42. sequential storage structure

43. precursor node