Let us change our traditional attitude to the construction of programs. Instead of imagining that our main task is to instruct a computer what to to, let us concentrate rather on explaining to human beings what we want a computer to do. Donald Knuth

Delete a node in a Doubly linked List

Language Java | Level Intermediate | Category Data structure | September 5, 2015 10:54 pm

Data structure Description

Write a program to delete the node in doubly linked list. The doubly linked list has two references one refer to the previous node and another refer to the next node. Delete node operation can delete head, tail or any position from the linked list.



Add 34 and 10 to the list.
Add 56 and 364 to the list.
Iterate the elements forward from Linked list: 34 10 56 364 
Remove first element from the list: 34
Remove last element from the list: 364
Iterate the elements Backward from Linked list: 56 10 



No comments available!

Please login to add comments.