Create a Doubly Linked List with JAVA

Output:

The elements of the list are: Al Amy Beth Bob

(Pre-written code below)

class DLinkedListTemplate { and a reference to the next node. */ private class Node { String value; // Value of a list element Node next; // Next node in the list Node prev; // Previous element in the list Node(String val, Node n, Node p) Node(String val) { // Just call the other (sister) constructor this(val, null, null); } } public DLinkedList() { first = null; last = null; } public boolean isEmpty() public int size() public void add(String e) { // Add to end of existing list } } public void add(int index, String e) { } public String toString() { StringBuilder strBuilder = new StringBuilder(); // Use p to walk down the linked list Node p = first; while(p != null) { strBuilder.append(p.value + " "); p = p.next; } return strBuilder.toString(); public String remove(int index) { public boolean remove(String element) // Locate the node targeted for removal Node pred = target.prev; // Node before the target Node succ = target.next; // Node after the target // Route forward and back pointers around // the node to be removed public static void main(String [] args) { DLinkedList ll = new DLinkedList(); ll.add("Amy"); ll.add("Bob"); ll.add(0, "Al"); ll.add(2, "Beth"); ll.add(4, "Carol"); System.out.pr