Write a function DeleteList() that takes a list, deallocates all of its memory and sets its head pointer to NULL (the empty list).
void DeleteList(struct node** headRef)
Write an Append() function that takes two lists, ‘a’ and ‘b’, appends ‘b’ onto the end of ‘a’, and then sets ‘b’ to NULL (since it is now trailing off the end of ‘a’).
void Append(struct node** aRef, struct node** bRef)
Write a function InsertNth( ) which inserts a new node at a specified index within a list. The caller may specify any index in the range [0..length], and the new node should be inserted so as to be at that index position.
void InsertNth(struct node** P, int index, int data)
What is the function of a linkage editor?
What are the advantages of dynamic linking?
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.