第三章链表1（The third chapter list 1）.docVIP

第三章链表1（The third chapter list 1） Chapter Three List of links 3-2 try to write an algorithm to find the first node in the single linked list with the table header node. If found, the function returns the address of the node I, and if not, the function returns 0. Troubleshooting】 Template class type ListNode Type * List Type:: getanode (int i) { Get the first node address in the list, I count from 0, I 0 oclock return pointer 0, i = 0 oclock return the header address. if (I, 1) return null; ListNode Type * p = A; int k = 0; while (P! = null $xmlesc k i) {p = P-link; k++; } return p; } 3-3 the HA and HB are two table head pointers with a non descending ordered single linked list with a header node, and try to design an algorithm to combine the two ordered lists into a non incremental ordered single linked list. The result list still uses the original two linked list storage space, does not occupy the other storage space. Duplicate data is allowed in the table. Troubleshooting】 # iostream. h Template class type class list; Template class type class ListNode { Friend class list Type; Public: ListNode (); Constructors ListNode (const type Item); Constructors Private: type data; ListNode Type *link; }; Template class type class List { Public: List (const type finishied); Create a list void browse (); Print List void merge (list Type HB); Link List Private: ListNode Type *first, *last; }; Implementation of member functions Template class type ListNode Type:: ListNode (): Link (null) {} constructor to initialize only the pointer member. Template class type ListNode Type:: ListNode (const type Item): Data (item), link (null) {} constructor to initialize data and pointer members. Template class type List Type:: List (const type finishied) { Create a single linked list with a header node, and finished is the sign to stop building the table input is a value that is not likely to occur in all input values. A = last = new ListNode Type (); Create a table header node Type value; L