I do not agree with you on point number 1. There are some problems which requires nodes to point to another list.. Like an Index.. Say you have 100's of lists.. 1 list has all the records from 1 yo 100 the next 101 to 200 and so on.. So you can use another list to index this list... Something like an index.. though trees can be used here.. Nodes pointing to lists do provide an advantage in some situations...
Originally posted by 7stud
"Very confused. Have only written a couple functions so far, but they are just sorting or printing, so they are void."
You're not even close so forget about it. Get some sleep and take your F. You need to write some simple functions first, and learn about passing by value and passing by reference, and how return types work the same way.
In case you decide to continue:
1)A linked list doesn't have a data member pointing to another list--what good would that do? A List class is going to have data members which are pointers to what are commonly called Nodes, and the Nodes are what actually contain the data in the List.
2)You can't decide what type most is in the return statement. most has a type, and that is the only type you can return.