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

table contains a number of pointers, the list can be divided into _______ and _______.

25. linear tables, stacks and queues are _______ for stack structure, only in the _______ insert and delete elements; to insert elements in the queue can only delete elements in ______ _______.

The 26. is provided with an empty stack, the existing input sequence 1, 2, 3, 4, 5, push, pop, after push, push, pop, push, push, the output sequence corresponding to the _______.

27. elements 1, 2, 3, 4, 5 in turn into the stack, if the output sequence 34251, sequence of operations should be carried out for push (S, 1), push (S, 2), ______, pop (S), push (S, 4), pop (S), ______, ______, pop (S), pop (S).

Circular queue 28. has N storage unit in a medium, when the queue is full with ______ elements.

29. have a tree, as shown, answer the following questions:

(1) the root of this tree is ();

(2) the leaf node of this tree is ()

(3) the degree of node C is (), and the degree of the tree is ()

(4) the children of node C are ()

(5) the parent of node C is ()

30. for an N node of two binary tree, the minimum depth of it may have to ______, the maximum depth is ______. 21.O (1)

22. the number of data elements contained in a linear table

23. the value of the physical storage address and pointer

24. single linked list, double linked list

25. linear, stack top, team tail, team head 26.2, 3

27.push (S, 3), pop (S) and push (S, 5) 28.n-1

29. (1) A (2) B, E, G, D (3) 2,3 (4) E, F (5) A

30.[log2n]+1, n

The total number of nodes and 31. a depth of K over the two fork tree for ______, the minimum depth of tree nodes in the total number of complete binary tree of two K for ______, maximum ______.

32. by a, B, C three nodes of two binary tree, a total of ______

different structure.

33. for a tree with n nodes of the tree, the tree of all nodes and the degree to ______.

In 34. a two binary tree, assuming that the nodes of degree 2 is 5, the nodes of degree 1 to 6, while the leaf nodes for a ______.