Question

I got a problem here, implementing a Sorted Doubly Linked List of first and last names.

Add a field to each link that indicates the alphabetically next first name; the existing next link is used to indicate the alphabetically next last name. You will also need a second root link for the list – the existing root link indicates the alphabetically first last name, and you will need one indicating the alphabetically first first name. Note that you will still only have one link object for each name entered in the list.

Having done this, make any necessary changes to your insert, lookup, and delete methods so that both interleaved lists are maintained. Also update the runtime estimates as required to remain accurate.

Finally, add a second lookup method that takes in a first name and returns all full names including that first name, and a second display method that prints the list of names out alphabetically by first name. Make sure you give runtime estimates for these methods as well.

And I am at a complete loss as how to do this. I already created a single linked list, with a first and last name, but that’s as far as I was able to get.

Any Help would be great 😀

Thank you.

Answer 1

1. Create a Link Class that has two link fields (nextFirstName, nextLastName) and a field for the Name Object.
2. On insert, first search the Link object that comes before (LastName) this new one and insert it after that using the nextLastName field. Then do the same with the FirstName, using the nextFirstName field as the link.
3. ?????
4. profit!

This does smell a lot like homework 🙂