Really need help.

[Johnn]

1. Design your own linked list class to hold a series of integers. The class should have member functions for appending, inserting, and deleting nodes. Don’t forget to add a destructor that destroys the list. Demonstrate the class with a driver program.

2. Modify the linked list class you created in the previous programming challenges to include a member function named search that returns the position of a specific value in the linked list. The first node in the list is at position 0, the second node is at position 1, and so on. If x is not found on the list, the search should return -1. Test the new member function using an appropriate driver program.

(I do not know how to do them..)
If you can let me know the answers, awesome. If not, thanks for looking.

[goldenchicken]

This is not a homework site. We won't make your homework. Give it a try yourself first, and when you're stuck, ask for help.