Add a method reverseTraverse to the MyLinkedListH1 class in the program shows be

Question

Add a method reverseTraverse to the MyLinkedListH1 class in the program shows below. Your reverseTraverse method should traverse and display the list in reverse order. Use recursion. class C15e5 { public static void main(String[] args) { MyLinkedListL5 list = new MyLinkedListL5(); list.addFirst(1); list.addFirst(2); list.addFirst(3); System.out.println("Numbers on list"); list.traverse(); } } //============================================== class MyLinkedListL5 // copy of MyLinkedList in Fig. 15.4 { private class Node { private Node link; private int x; } //---------------------------------- private Node first = null; //---------------------------------- public void addFirst(int d) { Node newNode = new Node(); newNode.x = d; newNode.link = first; first = newNode; } //---------------------------------- public void traverse() { Node p = first; while (p != null) { System.out.println(p.x); p = p.link; } } }

Explanation / Answer

package com.cramster.nov16; public class LinkedListTest { public static void main(String[] args) { LinkedList list = new LinkedList(); list.addFirst(1); list.addFirst(2); list.addFirst(3); System.out.println("Numbers on list"); list.traverse(); System.out.println("Numbers on list in reverse order"); list.reverseTraverse(); } } package com.cramster.nov16; public class LinkedList { private class Node { private Node link; private int x; } private Node first = null; public void addFirst(int d) { Node newNode = new Node(); newNode.x = d; newNode.link = first; first = newNode; } public void traverse() { Node p = first; while (p != null) { System.out.println(p.x); p = p.link; } } public void reverseTraverse() { Node p = first; recursive(p); } public void recursive(Node p) { if(p != null) { recursive(p.link); System.out.println(p.x); } } }

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.