Question
Q)To class DoubleLinkedList, add method insertBeforeLastNode(E e) that inserts a new node before the last node( list should have at least one node initially, if
Q)To class DoubleLinkedList, add method insertBeforeLastNode(E e) that inserts a new node before the last node( list should have at least one node initially, if not just display an error message).
(here is the code )
make sure to solve it corectly please
thanks
------------------------------------------------------------------------------------------------------------------------------------------------------
public class DoublyLinkedList
public DoublyLinkedList() { header = new Node<>(null, null, null); trailer = new Node<>(null, header, null); header.setNext(trailer); }
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public E first() { if (isEmpty()) return null; return header.getNext().getData(); }
public E last() { if (isEmpty()) return null; return trailer.getPrev().getData(); }
private void addBetween(E e, Node
}
private E remove(Node
public void addFirst(E e) { addBetween(e, header, header.getNext()); }
public void addLast(E e) { addBetween(e, trailer.getPrev(), trailer); }
public E removeFirst() { if (isEmpty()) return null; return remove(header.getNext()); }
public E removeLast() { if (isEmpty()) return null; return remove(trailer.getPrev()); }
public void printForward() { for (Node
public void printBackward() { for (Node
//---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
public class Node
public Node(E d, Node
public E getData() { return data; }
public Node
public Node
public void setNext(Node
public void setPrev(Node
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started