- Submit a public void method in the Singly Linked List class that swaps two non adjacent and not header and tail nodes. Copy the book’s class into your own project and modify.
- Add a RemoveAtEnd(int number), where the method removes that number of nodes from the end of the list. RemoveAtEnd(3) would remove the last 3 nodes in the list.
Sample Solution
