Linked List Routines
$20-25 USD
Paid on delivery
Given a structure or a class for a linked list or double link list:
struct listnode
{
int data;
struct listnode *next;
};
struct doublelistnode
{
int key;
struct doublelistnode *forward,
*backward;
};
Now write a package of routines that includes the following in both single linked list and the double link list:
A. Insert item at the beginning
B. Insert an item at the end
C. Insert an item correctly in an ordered list
D. Print out the list
E. Reverse the list
F. Make a copy of the list
G. Given two lists in ascending order, merge the lists into one list in ascending order
H. Given a linked list and a key, write a routine to split the list into two linked lists where the first list is all the items up to, but not including the key, and the second list is all the items after the key
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
## Platform
windows NT, 2000
Project ID: #3018772
About the project
Awarded to:
21 freelancers are bidding on average $15 for this job
