This document defines a MyLinkedList2 class with a Node inner class to represent nodes in a linked list. The MyLinkedList2 class contains methods to add nodes to the front of the list with addFirst(), traverse the list sequentially with traverse(), and reverse the list order with reverse(). A main method in a TestMyLinkedList2 class tests the list by adding 3 nodes to the front and printing the list.

1. class MyLinkedList2 // copy of MyLinkedList in Fig. 15.4 {
private class Node // inner class { private Node
link; private int x; } //----------------------------------
private Node first = null; // initial value is null //------------
---------------------- public void addFirst(int d) { Node
newNode = new Node(); // create new node newNode.x = d;
// init data field in new node newNode.link = first;
// new node points to first node first = newNode; //
first now points to new node } //--------------------------------
-- private void traverse(Node p) { if (p != null) {
System.out.println(p.x); // display data
traverse(p.link); // move p to next node } }
public void traverse() { traverse(first); } public void
reverseTest(); { Node p = first; if (p != null) {
System.out.println(p.x); traverse(p.link); //
move p to next node } } reverse(p); }
//==============================================
class TestMyLinkedList2 { public static void main(String[]
args) { MyLinkedList2 list2 = new MyLinkedList2();
list2.addFirst(1); list2.addFirst(2); list2.addFirst(3);
System.out.println("Numbers on list"); list2.traverse(); }
}