Question

1.

private Node head;
private Node tail;


public class Node {
    String name;
    Node next;
    Node prev;
}

public void displayInReverse(){
   //write your code here to display names in reverse
}

2.

public class NodeOne {
    String name;
    NodeOne next;

    public NodeOne(String name) {
        this.name = name;
    }
}

// Complete the code snippet below so that the delete method works properly
    public void delete(String name) {
        NodeOne temp = head, prev = head;
        while (temp != null) {
            if (temp.name.equals(name)) {
              
            }
           
        }
    }

PLEASE GIVE ME CODE IN JAVA THANKS

Answer 1

public void displayInReverse(){
Node trav=tail;
// starting from the tail
while(trav!=null){
   // printing name
   System.out.println(trav.name);
   // moving to previous node
   trav=trav.prev;
}
}

Answer 2:
public void delete(String name) {
NodeOne temp = head, prev = head;
while (temp != null) {
if (temp.name.equals(name)) {
               // storing the current node in temp
               Node t=temp.next;
               // making temp prev node next to temp next node
               temp.prev.next=temp.next;
               // making temp next node prev to temp prev node
               t.prev=temp.prev;
}
temp=temp.next;
}
}