Add doubly linked list print reverse (TheAlgorithms#2797)

iccowan · web-flow · commit 55c114df2e99 · 2021-11-02T21:28:00.000+02:00
diff --git a/DataStructures/Lists/DoublyLinkedList.java b/DataStructures/Lists/DoublyLinkedList.java
@@ -271,6 +271,18 @@ public void display() { // Prints contents of the list
     }
     System.out.println();
   }
+
+  /**
+   * Prints the contents of the list in reverse order
+   */
+  public void displayBackwards() {
+    Link current = tail;
+    while (current != null) {
+      current.displayLink();
+      current = current.previous;
+    }
+    System.out.println();
+  }
 }
 
 /**
@@ -311,28 +323,35 @@ public static void main(String args[]) {
     myList.insertHead(7);
     myList.insertHead(10);
     myList.display(); // <-- 10(head) <--> 7 <--> 13(tail) -->
+    myList.displayBackwards();
 
     myList.insertTail(11);
     myList.display(); // <-- 10(head) <--> 7 <--> 13 <--> 11(tail) -->
+    myList.displayBackwards();
 
     myList.deleteTail();
     myList.display(); // <-- 10(head) <--> 7 <--> 13(tail) -->
+    myList.displayBackwards();
 
     myList.delete(7);
     myList.display(); // <-- 10(head) <--> 13(tail) -->
+    myList.displayBackwards();
 
     myList.insertOrdered(23);
     myList.insertOrdered(67);
     myList.insertOrdered(3);
     myList.display(); // <-- 3(head) <--> 10 <--> 13 <--> 23 <--> 67(tail) -->
     myList.insertElementByIndex(5, 1);
     myList.display(); // <-- 3(head) <--> 5 <--> 10 <--> 13 <--> 23 <--> 67(tail) -->
-
+    myList.displayBackwards();
     myList.reverse(); // <-- 67(head) <--> 23 <--> 13 <--> 10 <--> 5 <--> 3(tail) -->
     myList.display();
+    
     myList.clearList();
     myList.display();
+    myList.displayBackwards();
     myList.insertHead(20);
     myList.display();
+    myList.displayBackwards();
   }
 }
