Every node must contain at least 2 field materials (key1,key2), as key1 as primary, key2 as the secondary (i.e. key1 small must arrange at front, if key1 is same, then key2 small platoon in front).
1. Input data
assigns additional (key1, key2) pair, take this pair to put in suitable place
Assigns the deletion (key1, key2) pair
Assigns key1 which wants to delete (All tallies all must delete)
Assigns key2 which wants to delete (All tallies all must delete)
3. Search data
Assigns (key1, key2)pair, passes on is located the several cis-position, if does not exist, then passes on - 1.
4. Output data
According to has continues the order in series.
The increase may willfully replace the key1, key2 primarily vice-increasing sorting way
I can't figure out how to write the program, I don't understand linked list that much. Do I need to use function recalls? Will some kind-hearted and intelligence persons write it for me PLEASE?