solution

import java.io.*;

import java.util.Scanner;

class linkedlist {

int value;

linkedlist previous;

linkedlist next;

linkedlist(int value) {

this.value = value;

}

void display() {

System.out.println("the valu is"+value);

}

}

class linked {

public linkedlist firstlinkedlistnode, lastlinkedlistnode;

linked() {

firstlinkedlistnode = null;

lastlinkedlistnode = null;

}

/* Insert linkedlistnode at the beginning or create linked list */

void insert_front(int value) {

linkedlist linkedlistnode = new linkedlist(value);

if(firstlinkedlistnode == null) {

linkedlistnode.previous = linkedlistnode.next = null;

firstlinkedlistnode = lastlinkedlistnode = linkedlistnode;

System.out.println("list created");

}

else {

linkedlistnode.previous = null;

linkedlistnode.next = firstlinkedlistnode;

firstlinkedlistnode.previous = linkedlistnode;

firstlinkedlistnode = linkedlistnode;

System.out.println("the firstlinkedlistnode inserted ");

}

}

/* Insert linkedlistnode at the end or create linked list */

void insert_end(int value) {

linkedlist linkedlistnode = new linkedlist(value);

if(firstlinkedlistnode == null) {

linkedlistnode.previous = linkedlistnode.next = null;

firstlinkedlistnode = lastlinkedlistnode = linkedlistnode;

System.out.println("the total list created");

}

else {

linkedlistnode.next = null;

linkedlistnode.previous = lastlinkedlistnode;

lastlinkedlistnode.next = linkedlistnode;

lastlinkedlistnode = linkedlistnode;

System.out.println("in the linkedlist end linkedlistnode inserted");

}

}

/* Delete linkedlistnode from linked list */

void delete() {

int countvalue = 0, no, i;

linkedlist linkedlistnode, linkedlistnode1, linkedlistnode2;

Scanner input = new Scanner(System.in);

for(linkedlistnode = firstlinkedlistnode; linkedlistnode != null; linkedlistnode = linkedlistnode.next)

countvalue++;

display();

linkedlistnode = linkedlistnode1 = linkedlistnode2 = firstlinkedlistnode;

System.out.println(countvalue+"the nodes in linkedlist");

System.out.println("enteeeer the linkedlistnode no to delete");

no = Integer.parseInt(input.nextLine());

if(no != 1) {

if(no < countvalue && no > 0) {

for(i = 2; i <= no; i++)

linkedlistnode = linkedlistnode.next;

for(i = 2; i <= no-1; i++)

linkedlistnode1 = linkedlistnode1.next;

for(i = 2; i <= no+1; i++)

linkedlistnode2 = linkedlistnode2.next;

linkedlistnode2.previous = linkedlistnode1;

linkedlistnode1.next = linkedlistnode2;

linkedlistnode.previous = null;

linkedlistnode.next = null;

linkedlistnode = null;

}

else if(no == countvalue) {

linkedlistnode = lastlinkedlistnode;

lastlinkedlistnode = linkedlistnode.previous;

lastlinkedlistnode.next = null;

linkedlistnode = null;

}

else

System.out.println("Invalid linkedlistnode no!\n");

}

else {

linkedlistnode = firstlinkedlistnode;

firstlinkedlistnode = linkedlistnode.next;

firstlinkedlistnode.previous = null;

linkedlistnode = null;

}

System.out.println("linkedlistnode has been deleted successfully!\n");

}

/* Display linked list */

void display() {

linkedlist linkedlistnode = firstlinkedlistnode;

System.out.println("List of linkedlistnode in Ascending order!");

while(linkedlistnode != null) {

linkedlistnode.display();

linkedlistnode = linkedlistnode.next;

}

linkedlistnode = lastlinkedlistnode;

System.out.println("List of linkedlistnode in Descending order!");

while(linkedlistnode != null) {

linkedlistnode.display();

linkedlistnode = linkedlistnode.previous;

}

}

}

class doublylinkedlist {

public static void main(String args[ ]) {

linked doublelinkedlist = new linked();

Scanner input = new Scanner(System.in);

int choice = 0;

while(choice != 5) {

System.out.println("1.for inserting beginning 2. for inserting at end 3. for deleting 4. for printing 5. for closing the program");

System.out.println("Enter your choice:");

choice = Integer.parseInt(input.nextLine());

switch(choice) {

case 1:

System.out.println("Enter a value");

doublelinkedlist.insert_front(Integer.parseInt(input.nextLine()));

break;

case 2:

System.out.println("Enter a value");

doublelinkedlist.insert_end(Integer.parseInt(input.nextLine()));

break;

case 3:

doublelinkedlist.delete();

break;

case 4:

doublelinkedlist.display();

break;

case 5:

System.out.println("u r exiting the program");

System.exit(0);

break;

default:

System.out.println("please select valid choice");

}

}

}

}

output

//i write the program for all options you just asked me only for delete at the front but i wrote the program all simulations.please see the program carefully if any doubt ask me