In java

Write a method public void printReverse() that prints the elements of a doubly linked list in reverse.

Write a method public void delete5FromTheEnd() which deletes the 5^th element from end of the list. Note that if you reach the end then you have to reverse the direction of counting.

In the main() method of the test class, create a randomly generated Doubly-Linked list of 10 Integers. Next, call the delete5FromTheEnd() method and print the lists iteratively until the list becomes empty. Make sure to print the list after each deletion.

For example, your list initially could be:

[ 3 1 2 5 8 7 ].

After deleting 5^th element from the end:

[ 3 1 2 5 8 7 ] => [ 3 2 5 8 7 ].

After deleting 5^th element again;

[ 3 2 5 8 7] => [ 2 5 8 7].

After deleting 5^th element again (counting in the reverse direction, then moving forward),

[ 2 5 8 7] => [ 2 8 7 ]

[2 8 7] => [2 8]

//**************************** DLL.java ******************************* // generic doubly linked list class

public class DLL { private DLLNode head, tail; public DLL() { head = tail = null; } public boolean isEmpty() { return head == null; } public void setToNull() { head = tail = null; } public T firstEl() { if (head != null) return head.info; else return null; } public void addToHead(T el) { if (head != null) { head = new DLLNode(el,head,null); head.next.prev = head; } else head = tail = new DLLNode(el); } public void addToTail(T el) { if (tail != null) { tail = new DLLNode(el,null,tail); tail.prev.next = tail; } else head = tail = new DLLNode(el); } public T deleteFromHead() { if (isEmpty()) return null; T el = head.info; if (head == tail) // if only one node on the list; head = tail = null; else { // if more than one node in the list; head = head.next; head.prev = null; } return el; } public T deleteFromTail() { if (isEmpty()) return null; T el = tail.info; if (head == tail) // if only one node on the list; head = tail = null; else { // if more than one node in the list; tail = tail.prev; tail.next = null; } return el; } public void printAll() { for (DLLNode tmp = head; tmp != null; tmp = tmp.next) System.out.print(tmp.info + " "); } public T find(T el) { DLLNode tmp; for (tmp = head; tmp != null && !tmp.info.equals(el); tmp = tmp.next); if (tmp == null) return null; else return tmp.info; } }

//**************************** DLLNode.java ******************************* // node of generic doubly linked list class

public class DLLNode { public T info; public DLLNode next, prev; public DLLNode() { next = null; prev = null; } public DLLNode(T el) { info = el; next = null; prev = null; } public DLLNode(T el, DLLNode n, DLLNode p) { info = el; next = n; prev = p; } }

************************DLLTest.java*********************************

public class DLLTest { public static void main(String[] args) { DLL test = new DLL(); for(int i = 0; i < 5; i++) test.addToTail("a" + i); test.printAll(); } }