I'm trying to do some sample exercises in Data Structures, but I'm a newbie when it comes to
Java language. So, could you help me what to do here? Your expertise will be greatly appreciated.
These examples are:
1) Write a method, L.delete First(),
that deletes the first node of a Linked.List object L.
2) Given a non-null pointer N to a List Node of a list L, and a pointer M to a new ListNode to be inserted, write a Java method to insert the node that is M's referent before the node that is N's referent on list L.
[Hint: Adjust pointers to indert M after N and then swap the airport codes in N and M.]
4-ever greatful-
CS
[ September 11, 2003: Message edited by: Corinna Sanchez ]