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

44. sort

45. points to the chain header node, pointing empty

46. pointer field or next domain

47. predecessor node, successor node

48.p->prior

49.head->next=head

50. first in first out, first in first out

The 51. assumption back into the stack and stack operation respectively expressed in S and X, the input sequence a, B, C, D, e after a series of stack operation SSXSXSSXXX, the output sequence is obtained ______.

52. in a one-dimensional array of a[n] stack, the stack contains the minimum number of elements for ______, up to ______.

53. in a length of N in the sequence table to delete the first I elements (0 i n-1), need to move forward ______ elements.

54. a data structure in computer (map) called ______.

55. in the linear structure and tree structure, between the precursor node and successor node there are ______ and ______ contact.

51.b, C, e, D, a 52, n-1 53.n-i

54. storage structure of data

55., one to one, one to many

56. every time out an element from the disorder in the child table, and then inserted into the ordered proper position in the table, this is called the _______ Ranking Ranking Method; each from unordered list selected one of the largest or smallest element, it is switched to an ordered list, this method is called ________ sorting.

57. as shown in the two binary tree traversal sequence is ____________.

56. insert, select

57.A, B, C, D, E, G, F

Some things, knowing that is wrong, but also to adhere to, because not reconciled; some people, knowing that love is also to give up, because there is no end; sometimes, knowing that there is no road, but still forward, because used to.