Description: 1, the merger of the two lists description of the problem: Let A and B are two nodes with the first order circular list (the so-called point of order is the link to the link at the size of data field values, this question may wish to set the value data field at an early age to large order), list1 and list2 points to the two lists were the head pointer. Please write the two lists into one ordered to take the lead node algorithm for circular linked list.
To Search:
File list (Check if you may need any files):
合并两个链表.cpp
Download