算法与数据结构习题答案（国外英文资料）.doc

算法与数据结构习题答案（国外英文资料） How many nodes do you need to move on average to insert and delete a node in a sequential table? What are the two factors? A: In the equal probability case, the insertion of a node in the order table requires an average of n / 2 nodes. Deleting a node requires an average movement (n - 1) / 2 nodes. The specific number of moves depends on the length of the order table and the location I that needs to be inserted or removed. The closer I is to n, the less I need to move. 3.12 said known by singly linked lists of linear table, contains three types of characters of data elements (such as: alphabetic characters, Numbers, characters and other characters), try to write algorithm to construct linear table of three said in a circular linked list, each table contains only the same kind of character, and make use of the primary node space in a table as a node of the three table space, head node can be another space. Solution: To solve this problem, as long as three new head node, then in turn in the original singly linked lists of query, find the kind of character nodes, nodes link to the corresponding head took off this just indicate the new list. Algorithm is as follows: / / set up an empty loop linked list A, B, C, and A, B, and C are the tail Pointers. LinkList A, LinkList A, LinkList A, LinkList C { ListNode * p = l- next, * q; While (p) {. If (p- data = a p- data = z | | p- = a p- data = z) {. Q = p- next; P = p- next; / / point to the next node Q - next = a- next; / / link the letter to A table A minus , next = q; A = q; } Else if (p- data = 0 p data = 9) {/ / the digital nodes Q = p- next; P = p- next; / / point to the next node So, q minus next is equal to B minus next. / / link the number node to the B table B minus , next = q; B = q; } Else {/ / the other character nodes Q = p- next; P = p- next; / / point to the next node Q- next = c- next; / / link the other nodes to the C table C minus , next = q; C = q; } } / / end 3.13 has a doubl